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