#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;

cs int N = 1e5 + 5; 
int n, X, a[N], pre[N], suf[N];
queue <int> q; 
bool era[N];
void del(int x) {
    era[x] = 1; 
    pre[suf[x]] = pre[x];
    suf[pre[x]] = suf[x];
}
int main() {
    #ifdef zqj 
    freopen("1.in","r",stdin);
    #endif
    ios::sync_with_stdio(false),cin.tie(0);
    cin >> n >> X;
    vector <int> s; 
    
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    } a[n] = a[0];
    for(int i = 0; i < n; i++) {
        pre[i] = i - 1, suf[i] = i + 1; 
    }
    pre[0] = n - 1; 
    suf[n - 1] = 0;
    for(int i = 0; i < n; i++) {
        if(a[i] + a[i + 1] == X || a[i] == a[i + 1]) {
            q.push(i);
        }
    }
    int cnt = 0; 
    while(!q.empty()) {
        int x = q.front(); q.pop();
        if(era[x]) continue;
        ++ cnt; 
        // cout << x <<' ' << suf[x] << endl;
        if(cnt == n / 2) break;
        int y = suf[x];
        if(a[x] == a[y] || a[x] + a[y] == X) {
            del(x), del(y);
        }
        x = pre[x];
        if(a[x] == a[suf[x]] || a[x] + a[suf[x]] == X) q.push(x);
    } 
    cout << cnt << '\n';
    return 0; 
}