#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, x;
  cin >> n >> x;
  vector<long long> v(n);
  for (long long i = 0; i < n; i++) cin >> v[i];
  sort(v.begin(), v.end());
  long long ans = 0;
  long long siz = v.size();
  while (v[(siz + 1) / 2 - 1] != x) {
    v.push_back(x);
    ans++;
    sort(v.begin(), v.end());
    siz++;
  }
  cout << ans << "\n";
  return 0;
}
