#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<cmath>
#define ll long long
using namespace std;
ll n,a[100100],st,ans;
set<ll>s;
ll read()
{ll aa=0,bb=1;char cc=getchar();while(cc>'9'||cc<'0'){if(cc=='-') bb=-1;cc=getchar();}while(cc>='0'&&cc<='9'){aa=(aa<<3)+(aa<<1)+(cc^'0');cc=getchar();}return aa*bb;
}
ll gcd(ll a,ll b)
{if(b==0) return a;return gcd(b,a%b);
}
int main()
{n=read();for(ll i=1;i<=n;i++) a[i]=read();ll st=1;while(st<=n){if(st==n){ans++;break;}ll d=abs(a[st+1]-a[st]);if(d==0||d==1){ans++;st++;continue;}s.insert(a[st]);s.insert(a[st+1]);ll i;for(i=st+2;i<=n;i++){if(s.find(a[i])!=s.end()) break;d=gcd(d,abs(a[i]-*s.begin()));if(d==1) break;s.insert(a[i]);}st=i;ans++;s.clear();}printf("%lld\n",ans);return 0;
}

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
struct node
{int to,nxt;
}h[5001000];
int n,m,nn,num,a[4001000],tot,nxt[5001000],son;
int read()
{int aa=0,bb=1;char cc=getchar();while(cc>'9'||cc<'0'){if(cc=='-') bb=-1;cc=getchar();}while(cc>='0'&&cc<='9'){aa=(aa<<3)+(aa<<1)+(cc^'0');cc=getchar();}return aa*bb;
}
void add(int x,int y)
{h[++tot].to=y;h[tot].nxt=nxt[x];nxt[x]=tot;
}
bool dfs(int x,int fa)
{if(x==son) return true;for(int i=nxt[x];i;i=h[i].nxt){int y=h[i].to;if(y==fa) continue;if(dfs(y,x)) return true;}return false;
}
int main()
{n=read();m=read();nn=n;int tpy,op,k,a,x,y;for(int i=1;i<=m;i++){tpy=read();if(!tpy){op=read();k=read();nn++;if(!op){for(int i=1;i<=k;i++){x=read();add(x,nn);if(k==1) add(nn,x);}}else{for(int i=1;i<=k;i++){x=read();add(nn,x);if(k==1) add(x,nn);}}}else{son=read();y=read();printf("%d\n",dfs(y,0));}}return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#define ll long long
using namespace std;
ll n,m,a[500100],b[500100],s[500100],f[500100];
priority_queue< pair<ll,ll> ,vector<pair<ll,ll> >,greater<pair<ll,ll> > >q,qq;
ll read()
{ll aa=0,bb=1;char cc=getchar();while(cc>'9'||cc<'0'){if(cc=='-') bb=-1;cc=getchar();}while(cc>='0'&&cc<='9'){aa=(aa<<3)+(aa<<1)+(cc^'0');cc=getchar();}return aa*bb;
}
int main()
{n=read();m=read();for(ll i=1;i<=n;i++) a[i]=read(),s[i]=s[i-1]+a[i];for(ll i=0;i<n;i++) b[i]=read();f[0]=0;for(ll i=1;i<=n;i++){q.push(make_pair(f[i-1]+b[i-1],i-1));ll ans=0x7fffffffffffff;while(q.size()&&q.top().second<i-m) q.pop();while(qq.size()&&qq.top().second<i-m) qq.pop();while(q.size()&&q.top().first<f[q.top().second]+s[i]-s[q.top().second]){qq.push(make_pair(f[q.top().second]-s[q.top().second],q.top().second));q.pop();}while(q.size()&&q.top().second<i-m) q.pop();while(qq.size()&&qq.top().second<i-m) qq.pop();if(q.size()) ans=min(ans,q.top().first);if(qq.size()) ans=min(ans,qq.top().first+s[i]);f[i]=ans;}printf("%lld\n",f[n]);return 0;
}