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

using namespace std;

int main() {
	int n, m;
	vector<bool> cup(4, false);

	cin >> n >> m;
	cup[n] = true;
	int p, q;
	for (int i = 0; i < m; i++) {
		cin >> p >> q;
		swap(cup[p], cup[q]);
	}
	auto it = find(cup.begin(), cup.end(), true);
	cout << it - cup.begin() << endl;
	return 0;
}