#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector<ll>
#define FOR(i,n) for(int i=0;i<n;i++)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second

const int MOD = (int)1e9+7;

int main()
{
    ll n,x;
    scanf("%lld%lld",&n,&x);
    ll A[n];
    FOR(i,n) scanf("%lld",&A[i]);
    if(n==1){
        cout<<0<<endl;
        return 0;
    }
    set<int> pos;
    priority_queue<pair<int,pii> > pq;
    FOR(i,n){
        pos.insert(i);
        if(A[i]==A[(i+1)%n]){
            pq.push(make_pair(0,make_pair(i,(i+1)%n)));
        }
        if(A[i]+A[(i+1)%n]==x){
            pq.push(make_pair(1,make_pair(i,(i+1)%n)));
        }
    }
    int ans = 0;
    while(!pq.empty()){
        pair<int,pii> ff = pq.top(); pq.pop(); 
        if(pos.count(ff.s.f)<=0 || pos.count(ff.s.s)<=0) continue;
        ans++;
        auto it1 = pos.find(ff.s.f);
        auto it2 = pos.find(ff.s.s);
        if(it1==pos.begin() || it2==pos.end()){
            //we are removing the ends 
            pos.erase(pos.find(ff.s.f));
            pos.erase(pos.find(ff.s.s));
            if(sz(pos)>1){
                it2 = pos.begin();
                it1 = pos.end(); it1--;
                if(A[*it1]==A[*it2]){
                    pq.push(make_pair(0,make_pair(*it1,*it2)));
                }
                if(A[*it1]+A[*it2]==x){
                    pq.push(make_pair(1,make_pair(*it1,*it2)));
                }
            }
        }
        else{
            it1--;
            it2++;
            if(A[*it1]==A[*it2]){
                pq.push(make_pair(0,make_pair(*it1,*it2)));
            }
            if(A[*it1]+A[*it2]==x){
                pq.push(make_pair(1,make_pair(*it1,*it2)));
            }
            pos.erase(pos.find(ff.s.f));
            pos.erase(pos.find(ff.s.s));
        }
    }

    printf("%d\n",ans);
    return 0;
}