#include <bits/stdc++.h>   using namespace std;   int arr[1000000];   int main() {     int n, x, counter = 0;     cin >> n >> x;     for (int i = 0; i < n; i++) scanf( %d , &arr[i]);     sort(arr, arr + n);     while (arr[((n + 1) / 2 - 1)] != x) {       arr[n++] = x;       sort(arr, arr + n);       counter++;     }     cout << counter;     return 0;   }   