#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f("date.in");
ofstream g("date.out"); 

vector <int> graph[100000];
int viz[100000];

void DFS(int node) {
    int i;
    viz[node] = 1;
    
    int lim = graph[node].size();

    for( i = 0; i < lim; i++ )
        if( !viz[i] )
            DFS(i);
}

int main()
{
    
    int n, m;

    f >> n >> m;
    g << n << " " << m;

    int i;
    for( i = 0; i < m; i++ ) {
        int x, y;
        f >> x >> y;
        graph[x].push_back(y);
        graph[y].push_back(x);
    }

    DFS(1);

    for( i = 1; i < n; i++ )
        if( !viz[i] ) {
            cout << "Nu este conex!\n";
            return 0;
        }
    
    cout << "Conex!\n";

    return 0;
}