#include <bits/stdc++.h>
using namespace std;
long long int P = pow(10, 9) + 7;
const long long int N = 1e5 + 20;
long long int n, x, f[N], a, ans;
vector<long long int> v;
void solve() {
  cin >> n >> x;
  v.push_back(-1);
  for (long long int i = 0; i < n; i++) cin >> a, f[a]++, v.push_back(a);
  if (f[x] == 0) ans++, v.push_back(x);
  sort(v.begin(), v.end());
  long long int m = v.size() / 2;
  while (v[m] != x) {
    ans++;
    v.push_back(x);
    sort(v.begin(), v.end());
    m = v.size() / 2;
  }
  cout << ans << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
