#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, x;
  multiset<int> s;
  scanf("%d %d", &n, &x);
  bool check = 0, found = 0;
  for (int i = 0; i < n; ++i) {
    int foo;
    scanf("%d", &foo);
    s.insert(foo);
    if (foo == x) found = 1;
  }
  int ans = 0;
  if (!found) s.insert(x), ++ans;
  while (1) {
    int idx = (s.size() + 1) / 2 - 1, i = 0;
    bool check = 0;
    for (auto cur : s) {
      if (i == idx) {
        if (cur == x) {
          printf("%d ", ans);
          return 0;
        } else if (cur > x) {
          check = 1;
          break;
        }
      }
      ++i;
    }
    s.insert(check ? 1 : 1e5);
    ++ans;
  }
}
