#include <bits/stdc++.h>
using namespace std;
const int M = 10000 + 10;
int a[M];
int main() {
  int n, x;
  cin >> n >> x;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  int num = n;
  while (a[(num + 1) / 2] != x) {
    a[++num] = x;
    sort(a + 1, a + num + 1);
  }
  cout << num - n << endl;
  return 0;
}
