#include using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using vi = vector; using vvi = vector; using vvvi = vector; using vll = vector; using vvll = vector; using vvvll = vector; using vs = vector; using pll = pair; using vp = vector; #define rep(i, n) for(ll i = 0; i < (n); i++) #define repb(i, n) for(ll i = (n)-1; i >= 0; i--) #define repr(i, a, b) for(ll i = (a); i < (b); i++) #define reprb(i, a, b) for(ll i = (b)-1; i >= (a); i--) #define ALL(a) (a).begin(), (a).end() #define SZ(x) ((ll)(x).size()) const ll MOD = 1000000007; const ll INF = 100000000000000000LL; const ld EPS = 1e-12L; const ld PI = 3.1415926535897932385L; inline ll GCD(ll a, ll b){ return b?GCD(b, a % b):a; } inline ll LCM(ll a, ll b){ return a/GCD(a, b)*b; } inline ll powint(ull x, ll y){ ll r=1; while(y){ if(y&1) r*=x; x*=x; y>>=1; } return r; } inline ll powmod(ll x, ll y, ll m = MOD){ ll r=1; while(y){ if(y&1) r*=x; x*=x; r%=m; x%=m; y>>=1; } return r; } templateinline bool chmax(S &a, const T &b){ if(ainline bool chmin(S &a, const T &b){ if(b> n; vll a(n); rep(i, n){ cin >> a[i]; } dp[0][0] = 1; dp[0][1] = 0; repr(i, 1, n){ if(a[i] == a[i-1]){ dp[i][0] = max(dp[i-1][0], dp[i-1][1]) + 1; dp[i][1] = max(dp[i-1][0], dp[i-1][1]); }else{ dp[i][0] = dp[i-1][1] + 1; dp[i][1] = max(dp[i-1][0], dp[i-1][1]); } } cout << max(dp[n-1][0], dp[n-1][1]) << endl; return 0; }