#include <bits/stdc++.h>
using namespace std;
int initial[1050];
int main() {
  int n, x;
  cin >> n >> x;
  for (int i = 0; i < n; i++) cin >> initial[i];
  sort(initial, initial + n);
  int i = 0;
  while (initial[i] < x && i < n) i++;
  int k = 0;
  while (initial[(n + k - 1) / 2] != x) {
    k++;
    for (int j = n + k - 1; j >= k + i - 1; j--) initial[j + 1] = initial[j];
    initial[k + i - 1] = x;
  }
  cout << k << "\n";
}
