#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int maxn = 105;

vector<int>e[maxn];
int n, c[maxn];
int sign;

int cnt[maxn][4];
void dfs(int x, const int y)
{
    c[x] = y;
    if (x == n)
    {
        sign = 1;
        return;
    }
    for (int i = 0; i < e[x].size(); i++)
    {
        int v = e[x][i];
        cnt[v][y]++;
    }
    for (int i = 1; i <= 4; i++)
    {
        if (cnt[x + 1][i]) continue;
        assert(i <= 4);
        dfs(x + 1, i);
        if (sign) return;
    }
    for (int i = 0; i < e[x].size(); i++)
    {
        int v = e[x][i];
        cnt[v][y]--;
    }
}

int main()
{
    // freopen("in.cpp", "r", stdin);
    //freopen("out.cpp", "w", stdout);
    cin >> n;
    int x, y;

    while (1) {
        string s;
        if (!(cin >> s)) break;
        x = y = 0;
        int j = 0;
        for (; s[j] != '-'; ++j) {
            x *= 10;
            x += s[j] - '0';
        }

        ++j;
        for (; j < s.size(); ++j) {
            y *= 10;
            y += s[j] - '0';
        }
        e[x].push_back(y);
        e[y].push_back(x);
    }

    for (int i = 1; i <= 4; i++)
    {
        dfs(1, i);
        if (sign)break;
    }
    for (int i = 1; i <= n; i++) cout << i << " " << c[i] << "\n";
    return 0;
}