#include <bits/stdc++.h>
const int N = 500 + 10;
int ar[N * N], n;
int main() {
  int x;
  scanf("%d%d", &n, &x);
  for (int i = 1; i <= n; ++i) scanf("%d", &ar[i]);
  std::sort(ar + 1, ar + n + 1);
  int ans = 0;
  while (ar[(n + 1) / 2] != x) {
    ar[++n] = x;
    std::sort(ar + 1, ar + n + 1);
    ++ans;
  }
  printf("%d\n", ans);
  return 0;
}
