#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
////////////////////////////////////////////////////////////////////////////////
int main()
{
freopen( "input.txt", "r", stdin );
freopen( "output.txt", "w", stdout );
int N, X, R, M1, M2;
vector < int > A, Up, Down;
cin >> N;
for ( unsigned i = 0; i < N; ++i )
{
cin >> X;
A.push_back( X );
}
if ( N == 1 )
{
cout << "1";
return 0;
}
Up.push_back( 1 );
Down.push_back( 1 );
for ( unsigned i = 1, L = A.size(); i < L; ++i )
{
if ( i & 1 )
{
if ( A.at( i ) > A.at( i - 1 ) )
Up.push_back( Up.at( i - 1 ) + 1 );
else
Up.push_back( 1 );
if ( A.at( i ) < A.at( i - 1 ) )
Down.push_back( Down.at( i - 1 ) + 1 );
else
Down.push_back( 1 );
}
else
{
if ( A.at( i ) < A.at( i - 1 ) )
Up.push_back( Up.at( i - 1 ) + 1 );
else
Up.push_back( 1 );
if ( A.at( i ) > A.at( i - 1 ) )
Down.push_back( Down.at( i - 1 ) + 1 );
else
Down.push_back( 1 );
}
}
R = max( *max_element( Up.begin(), Up.end() ), *max_element( Down.begin(), Down.end() ) );
cout << R;
return 0;
}