/**
 * @file qoj7615-1.cpp
 * @author n685
 * @brief
 * @date 2024-01-28
 *
 *
 */
#include <bits/stdc++.h>

#ifdef LOCAL
#include "dd/debug.h"
#else
#define dbg(...) 42
#define dbgR(...) 4242
#define dbgP(...) 420
#define dbgRP(...) 420420
void nline() {}
#endif

int main() {
#ifdef LOCAL
  std::freopen("input.txt", "r", stdin);
  std::freopen("output.txt", "w", stdout);
#else
  std::cin.tie(nullptr)->sync_with_stdio(false);
#endif

  int64_t n;
  int m;
  std::cin >> n >> m;

  std::map<int64_t, int> val;
  for (int i = 0; i < m; ++i) {
    int p;
    std::cin >> p;
    --p;
    val[p] = 1;
  }
  int ans = 0;
  while (n > 1) {
    dbg(n, (int)val.size());
    // std::map<int64_t, int> cval = val;
    std::vector<std::pair<int64_t, int>> vv(val.begin(), val.end());
    for (auto [aa, bb] : vv) {
      if (!val.contains(n - 1 - aa)) {
        val[n - 1 - aa] = 0;
      }
    }
    for (auto [aa, bb] : val) {
      int64_t a = aa;
      if (a >= n / 2) {
        break;
      }
      // if (a >= n / 2) {
      //   if (val.contains(n - 1 - a)) {
      //     continue;
      //   }
      // }
      // if (a >= n / 2) {
      //   a = n - 1 - a;
      // }
      int64_t b = n - 1 - a;
      assert(a < b);
      assert(b >= n / 2);
      int c, d;
      c = val[a];
      d = val[b];
      if ((c == 0 && d == 1) || (c == 1 && d == 0)) {
        ++ans;
        val[a] = 2;
      } else if (c == 2) {
        val[a] = d;
      }
    }
    // val.swap(cval);
    n /= 2;
    while (!val.empty() && val.rbegin()->first >= n) {
      val.erase(std::prev(val.end()));
    }
  }
  std::cout << ans << '\n';
}