#include <bits/stdc++.h>
using namespace std;
int n, x, a[512];
int main() {
  cin >> n >> x;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  int mid = (n - 1) / 2, res;
  if (x < a[0])
    res = (n > 1 ? n : 1);
  else if (x > a[n - 1])
    res = n + 1;
  else if (x == a[mid])
    res = 0;
  else {
    if (x < a[mid]) {
      while (x < a[mid]) mid--;
    } else {
      while (x > a[mid]) mid++;
    }
    int left, right, temp;
    if (x == a[mid])
      left = mid, right = n - 1 - mid;
    else if (x < a[mid])
      left = mid, right = n - mid;
    else
      left = mid + 1, right = n - 1 - mid;
    if (left < right) {
      temp = right - left;
      res = (temp > 1 ? temp - 1 : 0);
    } else {
      temp = left - right;
      res = temp;
    }
    if (x != a[mid]) res += 1;
  }
  cout << res << endl;
  return 0;
}
