1004A. Sonya and Hotels（暴力+map）

Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.

The country where Sonya lives is an endless line. There is a city in each integer coordinate on this line. She has $n$

hotels, where the $i$-th hotel is located in the city with coordinate $x_i$

. Sonya is a smart girl, so she does not open two or more hotels in the same city.

Sonya understands that her business needs to be expanded by opening new hotels, so she decides to build one more. She wants to make the minimum distance from this hotel to all others to be equal to $d$

. The girl understands that there are many possible locations to construct such a hotel. Thus she wants to know the number of possible coordinates of the cities where she can build a new hotel.

Because Sonya is lounging in a jacuzzi in one of her hotels, she is asking you to find the number of cities where she can build a new hotel so that the minimum distance from the original $n$

hotels to the new one is equal to $d$

.

Input

The first line contains two integers $n$

and $d$ ( $1\le n\le 100$, $1\le d\le {10}^9$

) — the number of Sonya's hotels and the needed minimum distance from a new hotel to all others.

The second line contains $n$

different integers in strictly increasing order $x_1,x_2,\dots ,x_n$ ( $-{10}^9\le x_i\le {10}^9$

) — coordinates of Sonya's hotels.

Output

Print the number of cities where Sonya can build a new hotel so that the minimum distance from this hotel to all others is equal to $d$

.

Examples

Input

Copy

4 3
-3 2 9 16

Output

Copy

6

Input

Copy

5 2
4 8 11 18 19

Output

Copy

5

Note

In the first example, there are $6$

possible cities where Sonya can build a hotel. These cities have coordinates $-6$, $5$, $6$, $12$, $13$, and $19$

.

In the second example, there are $5$

possible cities where Sonya can build a hotel. These cities have coordinates $2$, $6$, $13$, $16$, and $21$.

题意：

在一条直线上有n家宾馆，现在要新建一家宾馆，要求新建的宾馆与原来的n家宾馆的最小距离是d，且每个位置只能建一家宾馆

求满足要求要求的位置的个数

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
const int N = 105;
map<int,int>mp;
int arr[N];
int check(int n,int x,int d){
	for(int i=0;i<n;i++){
		if(fabs(arr[i]-x)<d) return 0;
	}
	return 1;
}
int main(){
	int n,d;
	scanf("%d%d",&n,&d);
	for(int i=0;i<n;i++){
		scanf("%d",&arr[i]);
		mp[arr[i]]=1;
	}  
	int ans=0;
	for(int i=0;i<n;i++){
		int x=arr[i]-d;
		int y=arr[i]+d;
		if(check(n,x,d)&&!mp[x]){
		  ans++;
		  mp[x]=1;	
		}
		if(check(n,y,d)&&!mp[y]){
		  ans++; 
		  mp[y]=1;
		}
	}
	printf("%d\n",ans);
	return 0;
}