#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int N, M;
  cin >> N >> M;

  vector<int> a(3,0);
  a[N-1] = 1;

  int x1, x2;
  for(int i=0; i<M; i++){
    cin >> x1 >> x2;
    swap(a[x1-1], a[x2-1]);
  }
  cout << find(a.begin(), a.end(), 1) - a.begin() + 1 << endl;
  return 0;
}