#include using namespace std; typedef long long ll; typedef long double ld; typedef pair Pii; typedef pair Pil; typedef pair Pll; typedef pair Pli; typedef vector> Mat; #define fi first #define se second const ll MOD = 1e9 + 7; const ll MOD2 = 998244353; const ll MOD3 = 1812447359; const ll INF = 1ll << 62; const double PI = 2 * asin(1); void yes() { printf("yes\n"); } void no() { printf("no\n"); } void Yes() { printf("Yes\n"); } void No() { printf("No\n"); } void YES() { printf("YES\n"); } void NO() { printf("NO\n"); } int n, m, p[205], q[205]; bool ans[4]; int main() { cin >> n >> m; ans[n] = true; for (int i = 1; i <= m; i++) { cin >> p[i] >> q[i]; swap(ans[p[i]], ans[q[i]]); } for (int i = 1; i <= 3; i++) { if (ans[i]) { cout << i << endl; } } return 0; }