#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


/*
  fix max u to select
  G[S]: induced subgraph, {u} \subseteq S \subseteq [0, u]
  
  \sum[S] [G[S]: connected]
  == \sum[S] # (color each component of G[S] in 1,2, color u in 1)  (mod 2)
  =  # (color in 0,1,2, color u in 1, no 1-2 edge)
*/

constexpr int W = 13;
constexpr int MAX = 1594323;

Int THR[W + 1];
Int MASK[MAX][3];

int N, M;
vector<int> A, B;

int main() {
  THR[0] = 1;
  for (int e = 1; e <= W; ++e) THR[e] = THR[e - 1] * 3;
  for (int p = 0; p < THR[W]; ++p) {
    for (int e = 0; e < W; ++e) {
      MASK[p][p / THR[e] % 3] |= 1<<e;
    }
  }
  
  for (; ~scanf("%d%d", &N, &M); ) {
    A.resize(M);
    B.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
      if (A[i] > B[i]) swap(A[i], B[i]);
    }
    
    int ans = 0;
    bitset<MAX> crt;
    crt.set(0);
    for (int u = 0; u < N; ++u) {
      int adj = 0;
      for (int i = 0; i < M; ++i) if (B[i] == u) adj |= 1 << (u - 1 - A[i]);
      int here = 0;
      bitset<MAX> nxt;
      for (int p = 0, pp = 0; p < THR[W]; ++p, ++pp) if (crt[p]) {
        if (pp == MAX/3) pp = 0;
        nxt.flip(pp * 3 + 0);
        if (!(MASK[p][2] & adj)) { nxt.flip(pp * 3 + 1); here ^= 1; }
        if (!(MASK[p][1] & adj)) { nxt.flip(pp * 3 + 2); }
      }
cerr<<u<<": "<<here<<endl;
      ans ^= here;
      crt = nxt;
    }
    printf("%d\n", ans);
  }
  return 0;
}