#include <iostream>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <vector>
#include <string>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <iomanip>

using namespace std;

#define ll long long

int n, m;
vector<vector<int>> graph;
vector<int> path; 
vector<multiset<int>> adj; // use multiset to remove edges one by one

void ReadData() {
    cin >> n >> m;
    graph.assign(n, vector<int>());
    adj.assign(n, multiset<int>());

    for (int i = 0; i < m; i++) {
        int start = 0, end = 0;
        cin >> start >> end ;
        start--; end--;
        if (start != end) {
            graph[start].push_back(end);
            graph[end].push_back(start);
            adj[start].insert(end);
            adj[end].insert(start);
        } else {
            graph[start].push_back(end);
            adj[start].insert(end);
        }
    }
}

void Solve() {
    
    cout << "1\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    freopen("cyclueuler.in", "r", stdin);
    freopen("cyclueuler.out", "w", stdout);

    int t = 1;
    // cin >> t; // Uncomment for multiple test cases
    while (t--) {
        ReadData();
        Solve();
    }
    return 0;
}