#include <vector>
#include <set>
#include <algorithm>
using namespace std;
typedef long long ll;
class PiecewiseLinearFunction{
public:
int maximumSolutions(vector <int> Y){
int N = Y.size();
vector<ll> v(N);
set<ll> s;
for( int i=0; i<N; i++ ){
v[i] = ((ll)Y[i])*2;
s.insert( v[i] );
if( i>0 && v[i] == v[i-1] ) return -1;
}
vector<ll> w( s.begin(), s.end() );
int ret=0;
for( int i=0; i<w.size()-1; i++ ){
for( ll p = w[i]-1; p <= w[i]+1; p++ ){
int d = 0;
if( v[0] == p ) d++;
for( int j=1; j<N; j++ ){
if( (v[j-1] < p && p <= v[j]) || (v[j-1] > p && p >= v[j]) )
d++;
}
ret = max( ret, d );
}
}
return ret;
}
};
I2luY2x1ZGUgPHZlY3Rvcj4KI2luY2x1ZGUgPHNldD4KI2luY2x1ZGUgPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKdHlwZWRlZiBsb25nIGxvbmcgbGw7CmNsYXNzIFBpZWNld2lzZUxpbmVhckZ1bmN0aW9uewpwdWJsaWM6CiAgaW50IG1heGltdW1Tb2x1dGlvbnModmVjdG9yIDxpbnQ+IFkpewogICAgaW50IE4gPSBZLnNpemUoKTsKICAgIHZlY3RvcjxsbD4gdihOKTsKICAgIHNldDxsbD4gczsKICAgIGZvciggaW50IGk9MDsgaTxOOyBpKysgKXsKICAgICAgdltpXSA9ICgobGwpWVtpXSkqMjsKICAgICAgcy5pbnNlcnQoIHZbaV0gKTsKICAgICAgaWYoIGk+MCAmJiB2W2ldID09IHZbaS0xXSApIHJldHVybiAtMTsKICAgIH0KICAgIHZlY3RvcjxsbD4gdyggcy5iZWdpbigpLCBzLmVuZCgpICk7CiAgICBpbnQgcmV0PTA7CiAgICBmb3IoIGludCBpPTA7IGk8dy5zaXplKCktMTsgaSsrICl7CiAgICAgIGZvciggbGwgcCA9IHdbaV0tMTsgcCA8PSB3W2ldKzE7IHArKyApewogICAgICAgIGludCBkID0gMDsKICAgICAgICBpZiggdlswXSA9PSBwICkgZCsrOwogICAgICAgIGZvciggaW50IGo9MTsgajxOOyBqKysgKXsKICAgICAgICAgIGlmKCAodltqLTFdIDwgcCAmJiBwIDw9IHZbal0pIHx8ICh2W2otMV0gPiBwICYmIHAgPj0gdltqXSkgKQogICAgICAgICAgICBkKys7CiAgICAgICAgfQogICAgICAgIHJldCA9IG1heCggcmV0LCBkICk7CiAgICAgIH0KICAgIH0KICAgIHJldHVybiByZXQ7CiAgfQp9Ow==