#include <bits/stdc++.h>
using namespace std;
bool judge = 0;
int main() {
  int n, x, a[505], start, end, s = 1, ans = 0;
  scanf("%d %d", &n, &x);
  start = n + 1;
  end = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (a[i] == x) judge = 1;
  }
  if (judge == 0) {
    a[n + 1] = x;
    ans++;
    n++;
  }
  sort(a + 1, a + 1 + n);
  while (1) {
    int m = (s + n) / 2;
    if (a[m] == x)
      break;
    else if (a[m] < x)
      n++;
    else
      s--;
    ans++;
  }
  printf("%d\n", ans);
  return 0;
}
