#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;

ifstream is("santa.in");
ofstream os("santa.out");

vector<vector<int>> g;
vector<int> d, d2, ver, num, ap;
vector<bool> v;
int n, m, x, y, z, nr, rez;
queue<int> Q;

vector<int> BF( int k, vector<int> s );

int main()
{

    os << "No chance";

    is.close();
    os.close();
    return 0;
}

vector<int> BF( int k, vector<int> s )
{
    Q.push(k);
    s[k] = 0;
    v[k] = true;
    while( !Q.empty() )
    {
        k = Q.front();
        Q.pop();
        for( const auto& c : g[k] )
        {
            if ( !v[c] && s[c] > s[k] + 1 )
            {
                s[c] = s[k] + 1;
                Q.push(c);
            }
        }
    }
    return s;
}