#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, x;
  cin >> n >> x;
  int eq = 0;
  int minPos = 1, maxPos;
  for (int i(0); i < n; i++) {
    int a;
    cin >> a;
    if (a < x)
      minPos++;
    else if (a == x)
      eq++;
  }
  int c = 0;
  if (eq == 0) {
    c++;
    maxPos = minPos;
  } else
    maxPos = minPos + eq - 1;
  while ((minPos > (n + c + 1) / 2) || (maxPos < (n + c + 1) / 2)) {
    if (maxPos < (n + c + 1) / 2) {
      minPos++;
      maxPos++;
    };
    c++;
  }
  cout << c << endl;
}
