#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

#include <assert.h>

#define IOS ios::sync_with_stdio(false)

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

const int maxn = 1e6 + ;

int first[maxn];

struct node {

    int tonext;

    int u, v;

}e[maxn];

int num;

int g[maxn];

int b[maxn];

int col[maxn];

void add(int u, int v) {

    ++num;

    e[num].u = u;

    e[num].v = v;

    e[num].tonext = first[u];

    first[u] = num;

}

bool vis[maxn];

int must[maxn];

void dfs(int cur, int which) {

    col[cur] = which;

    for (int i = first[cur]; i; i = e[i].tonext) {

        int v = e[i].v;

        if (vis[v]) {

//            if (col[v] != !which) {

//                cout << -1 << endl;

//                exit(0);

//            }

            continue;

        }

        vis[v] = true;

        dfs(v, !which);

    }

}

void work() {

    int n;

    scanf("%d", &n);

    for (int i = ; i <= n; ++i) {

        int u, v;

        scanf("%d%d", &u, &v);

        b[i] = u;

        g[i] = v;

        add(u, v);

        add(v, u);

    }

    for (int i = ; i <= n; ++i) {

        add( * i - ,  * i);

        add( * i,  * i - );

    }

    for (int i = ; i <=  * n; ++i) {

        if (vis[i]) continue;

        vis[i] = true;

        dfs(i, );

    }

    for (int i = ; i <= n; ++i) {

        printf("%d %d\n", col[b[i]] + , col[g[i]] + );

    }

}

int main() {

#ifdef local

    freopen("data.txt", "r", stdin);

//    freopen("data.txt", "w", stdout);

#endif

    work();

    return ;

}