#include <bits/stdc++.h>
using namespace std;
int m[505];
int main() {
  int n, k;
  cin >> n >> k;
  int i;
  bool there = false;
  for (i = 1; i <= n; i++) {
    cin >> m[i];
    if (m[i] == k) {
      there = true;
    }
  }
  int ans = 0;
  if (!there) {
    m[n + 1] = k;
    n++;
    ans++;
  }
  sort(m + 1, m + n + 1);
  int mid = (n + 1) / 2;
  int dif = 0;
  int st = 1;
  int end = n;
  while (m[(st + end) / 2] != k) {
    if (m[(st + end) / 2] < k) {
      end++;
      ans++;
    } else {
      st--;
      ans++;
    }
  }
  cout << ans << endl;
  return 0;
}
