#include <bits/stdc++.h>
using namespace std;
int ar[10010];
int main() {
  int n, x;
  ;
  scanf("%d%d", &n, &x);
  ;
  int a = 0, b = 0;
  int flag = 0;
  for (int i = 1; i < n + 1; i++) {
    cin >> ar[i];
    if (ar[i] == x) flag = 1;
  }
  int ans = 0;
  sort(ar + 1, ar + n + 1);
  while (1) {
    int p = (n + 1) / 2;
    if (ar[p] == x) break;
    n++;
    ar[n] = x;
    ans++;
    sort(ar + 1, ar + n + 1);
  }
  cout << ans << endl;
  return 0;
}
