#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<iomanip>
#include<ctime>
#include<climits>
#include<cctype>
#include<algorithm>
#ifdef WIN32
#define AUTO "%I64d"
#else
#define AUTO "%lld"
#endif
using namespace std;
#define lowbit(x) x&-x
#define smax(x,tmp) x=max(x,tmp)
const int maxn=100005;
const int INF=0x3f3f3f3f;
int high[maxn],low[maxn];//!! LAST RE!!! BIT  must be bigger!! maxheight!!!
int f[maxn][2];//0: low point ; 1: high point
int a[maxn];
int n;
int maxheight=-INF;
inline void add_low(int x,int val)
{for(int i=x;i<=maxheight+1;i+=lowbit(i)) smax(low[i],val);//also easy to consider as n!!
}
inline void add_high(int x,int val)
{for(int i=x;i<=maxheight+1;i+=lowbit(i)) smax(high[i],val);
}
inline int query_low(int x)
{int ret=0;for(int i=x;i;i-=lowbit(i))    smax(ret,low[i]);return ret;
}
inline int query_high(int x)
{int ret=0;for(int i=x;i;i-=lowbit(i)) smax(ret,high[i]);return ret;
}int main()
{freopen("flower.in","r",stdin);freopen("flower.out","w",stdout);scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d",a+i),smax(maxheight,a[i]);int ans=1;f[1][0]=f[1][1]=1;add_low(a[1]+1,f[1][0]);add_high(maxheight-a[1]+2,f[1][1]);//add reversely, to query the max !!for(int i=2;i<=n;i++){f[i][0]=query_high(maxheight-a[i]+1)+1;f[i][1]=query_low(a[i])+1;add_low(a[i]+1,f[i][0]);//can't either!!add_high(maxheight-a[i]+2,f[i][1]);// mustn't use the 0 point !!smax(ans,max(f[i][0],f[i][1]));}printf("%d",ans);return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<iomanip>
#include<ctime>
#include<climits>
#include<cctype>
#include<algorithm>
#ifdef WIN32
#define AUTO "%I64d"
#else
#define AUTO "%lld"
#endif
using namespace std;
#define lowbit(x) x&-x
#define smax(x,tmp) x=max(x,tmp)
const int maxn=100005;
const int maxh=1000005;
const int INF=0x3f3f3f3f;
int high[maxh],low[maxh];//for BIT
int f[maxn][2];//0: low point ; 1: high point
int a[maxn];
int n;
int maxheight=-INF;
inline void add_low(int x,int val)
{for(int i=x;i<=maxheight+1;i+=lowbit(i)) smax(low[i],val);
}
inline void add_high(int x,int val)
{for(int i=x;i<=maxheight+1;i+=lowbit(i)) smax(high[i],val);
}
inline int query_low(int x)
{int ret=0;for(int i=x;i;i-=lowbit(i))    smax(ret,low[i]);return ret;
}
inline int query_high(int x)
{int ret=0;for(int i=x;i;i-=lowbit(i)) smax(ret,high[i]);return ret;
}int main()
{freopen("flower.in","r",stdin);freopen("flower.out","w",stdout);scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d",a+i),smax(maxheight,a[i]);int ans=1;f[1][0]=f[1][1]=1;add_low(a[1]+1,f[1][0]);add_high(maxheight-a[1]+2,f[1][1]);//add reversely, to query the max !!for(int i=2;i<=n;i++){f[i][0]=query_high(maxheight-a[i]+1)+1;f[i][1]=query_low(a[i])+1;add_low(a[i]+1,f[i][0]);//can't either!!add_high(maxheight-a[i]+2,f[i][1]);// mustn't use the 0 point !!smax(ans,max(f[i][0],f[i][1]));}printf("%d",ans);return 0;
}//O(n): f[i][0,1] indicates that don't need to stop at i, but had the previous cases//O(n): find the corners with the tendency

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<iomanip>
#include<ctime>
#include<climits>
#include<cctype>
#include<algorithm>
#ifdef WIN32
#define AUTO "%I64d"
#else
#define AUTO "%lld"
#endif
using namespace std;
#define lowbit(x) x&-x
#define smax(x,tmp) x=max(x,tmp)
const int maxn=100005;
const int INF=0x3f3f3f3f;
int n;
int a[maxn];
int main()
{freopen("flower.in","r",stdin);freopen("flower.out","w",stdout);scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d",a+i);int ans=2;for(int i=2;i^n;i++){if(a[i-1]>a[i] && a[i]<a[i+1]) ans++;//Last WA!! not only the near one, but long tremsif(a[i-1]<a[i] && a[i]>a[i+1]) ans++;}printf("%d",ans);return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<iomanip>
#include<ctime>
#include<climits>
#include<cctype>
#include<algorithm>
#ifdef WIN32
#define AUTO "%I64d"
#else
#define AUTO "%lld"
#endif
using namespace std;
#define lowbit(x) x&-x
#define smax(x,tmp) x=max(x,tmp)
const int maxn=100005;
const int INF=0x3f3f3f3f;
int n;
int a[maxn];
int main()
{freopen("flower.in","r",stdin);freopen("flower.out","w",stdout);scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d",a+i);int ans=1;//indicates the first one to start!!int flag=0;//indicates start!!for(int i=1;i^n;i++){if(a[i]<a[i+1] && (flag==0 || flag==-1)) flag=1,ans++;if(a[i]>a[i+1] && (flag==0 || flag==1)) flag=-1,ans++;}printf("%d",ans);return 0;
}