2 1
1 1
 4 1
2 2 1 1
 10 1
2 6 3 4 2 4 4 3 2 1
 2 1
999152 999153
 8 1000000
1 1 5 1000000 1000000 2 2 2
 9 2
1 6 1 5 5 8 6 8 7
 15 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 1 4
8
 10 1
6 3 1 3 6 4 1 3 6 4
 10 1
1 2 3 5 6 8 10 11 9 4
 7 2
1 5 5 8 9 8 8
 2 1000000
1 1000000
 8 2
3 13 9 8 3 13 9 14
 1 1
1
 2 1
1 2

2
 2
 4
 1
 2
 4
 15
 1
 7
 2
 4
 1
 5
 1
 1

#include <bits/stdc++.h>
using namespace std;
bool comp(int x, int y) { return x > y; }
int main() {
  int n, t;
  cin >> n >> t;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v.push_back(x);
  }
  sort(v.begin(), v.end(), comp);
  vector<int> pr;
  int k = 0;
  for (int i = 0; i < v.size() - 1; i++) pr.push_back(v[i] - v[i + 1]);
  sort(pr.begin(), pr.end());
  pr.erase(unique(pr.begin(), pr.end()), pr.end());
  if (pr.size() == 1) {
    cout << n << endl;
    return 0;
  }
  ((pr.size() / 2) % 2 == 0) ? cout << pr.size() / 2 + 1 << endl
                             : cout << pr.size() / 2 << endl;
  return 0;
}
