#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, p, c = 0;
  cin >> n >> k;
  vector<int> v;
  map<int, int> m;
  for (int i = 1; i <= n; i++) {
    cin >> p;
    v.push_back(p);
    m[p]++;
  }
  if (m[k] == 0) v.push_back(k), c++, n++;
  sort(v.begin(), v.end());
  while (1) {
    int x = (n + 1) / 2;
    if (v[x - 1] == k) {
      cout << c;
      return 0;
    } else if (v[x - 1] < k) {
      v.push_back(100000);
      n++;
      c++;
    } else
      v.push_back(1), n++, c++;
    sort(v.begin(), v.end());
  }
}
