#include <bits/stdc++.h>
using namespace std;
int main() {
  int N, X;
  vector<int> v;
  int res = 0;
  scanf("%d%d", &N, &X);
  bool found = false;
  for (int i = 0; i < N; i++) {
    int a;
    scanf("%d", &a);
    v.push_back(a);
    if (a == X) found = true;
  }
  if (!found) {
    v.push_back(X);
    res++;
  }
  sort(v.begin(), v.end());
  int indexMin = 0;
  int indexMax = 0;
  for (int i = 0; i < v.size(); i++)
    if (v[i] == X) {
      indexMin = i;
      break;
    }
  for (int i = v.size() - 1; i >= 0; i--)
    if (v[i] == X) {
      indexMax = i;
      break;
    }
  indexMin++;
  indexMax++;
  int s = v.size();
  while (true) {
    if (indexMin <= (s + 1) / 2 && indexMax >= (s + 1) / 2) break;
    indexMax++;
    s++;
    res++;
  }
  printf("%d\n", res);
  return 0;
}
