#include <iostream>

#include <cstdio>

#include <vector>

#include <cstring>

#define maxn 40

using namespace std;

int a[maxn][maxn], vis[maxn], ans, f[maxn];

vector<int> q;

int build(int x, int y)

{

    a[x][y] = ;

    a[y][x] = ;

}

int found(int x)

{

    if (f[x] == x) return x;

    f[x] = found(f[x]);

    return f[x];

}

int add(int x, int y)

{

    int fx = found(x), fy = found(y);

    if (fx != fy) f[fx] = fy;

}

void DFS(int k, int n)

{

    if (k == n)

    {

        for (int i = ; i < q.size()-; i++)

            cout << q[i] << " ";

        cout << q[q.size()-] << endl;

        ans++;

    }

    for (int  i = ; i <= maxn / ; i++)

        if (!vis[i] && a[k][i])

        {

            vis[i] = ;

            q.push_back(i);

            DFS(i, n);

            q.pop_back();

            vis[i] = ;

        }

}

int main()

{

    int n, cases = ;

    while (cin >> n)

    {

        memset(a, , sizeof(a));

        memset(vis, , sizeof(vis));

        for (int i = ; i <= maxn/; i++) f[i] = i;

        ans = ;

        while (!q.empty()) q.pop_back();

        int x, y;

        while (cin >> x >> y && x && y)

        {

            build(x, y);

            add(x, y);

        }

        ++cases;

        printf("CASE %d:\n", cases);

        q.push_back();

        vis[] = ;

        if (found() == found(n)) DFS(, n);

        printf("There are %d routes from the firestation to streetcorner %d.\n", ans, n);

    }

}

#