#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
 
using namespace std;
 
#if __GNUC__
#include <tr1/unordered_map>
#include <tr1/unordered_set>
using namespace tr1;
#else
#include <unordered_map>
#include <unordered_set>
#endif
 
#ifdef __GNUC__
template <class T> int popcount(T n);
template <> int popcount(unsigned int n) { return __builtin_popcount(n); }
template <> int popcount(int n) { return __builtin_popcount(n); }
template <> int popcount(unsigned long long n) { return __builtin_popcountll(n); }
template <> int popcount(long long n) { return __builtin_popcountll(n); }
#else
#define __typeof__ decltype
template <class T> int popcount(T n) { return n ? 1 + popcount(n & (n - 1)) : 0; }
#endif
 
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(src))
 
template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }
 
typedef long long ll;
typedef pair<int, int> pint;
 
template <class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p) { os << "( " << p.first << ", " << p.second << " )"; return os;  }
 
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
 
 
const int mod = 1000000007;
const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
bool valid_pos(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
 
template <class T> void print(T a, int n, int br = 1, const string& deli = ", ") { cout << "{ "; for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } cout << " }"; while (br--) cout << endl; }
template <class T> void print(const vector<T>& v, int br = 1, const string& deli = ", ") { print(v, v.size(), br, deli); }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) {	if (width != -1) cout.width(width); cout << a[i][j] << ' ';	} cout << endl; } while (br--) cout << endl; }
 
template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T, class U> void input(T& a, U& b, int n) { for (int i = 0; i < n; ++i) cin >> a[i] >> b[i]; }
 



enum Face { TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT };
template <class T>
class TDice
{
private:
	int id[6];
	T var[6];

	void init()
	{
		id[TOP] = 0; id[BOTTOM] = 5;
		id[FRONT] = 1; id[BACK] = 4;
		id[LEFT] = 2; id[RIGHT] = 3;
	}

	void roll(Face a, Face b, Face c, Face d)
	{
		int t = id[a];
		id[a] = id[b]; id[b] = id[c];
		id[c] = id[d]; id[d] = t;
	}
public:
	TDice()
	{
		init();
		for (int i = 0; i < 6; ++i)
			var[id[i]] = id[i] + 1;
	}

	T& operator[](Face f) { return var[id[f]]; }
	const T& operator[](Face f) const { return var[id[f]]; }
	bool operator==(const TDice<T>& b) const
	{
		const TDice<T>& a = *this;
		for (int i = 0; i < 6; ++i)
			if (a[i] != b[i])
				return false;
		return true;
	}

	// FRONT
	void roll_x() { roll(TOP, BACK, BOTTOM, FRONT); }
	// RIGHT
	void roll_y() { roll(TOP, LEFT, BOTTOM, RIGHT); }
	// left rotate
	void roll_z() { roll(FRONT, RIGHT, BACK, LEFT); }
	// BACK
	void rev_roll_x() { for (int i = 0; i < 3; ++i) roll_x(); }
	// LEFT
	void rev_roll_y() { for (int i = 0; i < 3; ++i) roll_y(); }
	// right rotate
	void rev_roll_z() { for (int i = 0; i < 3; ++i) roll_z(); }

	vector<TDice> all_rolls()
	{
		vector<TDice> res;
		for (int i = 0; i < 6; ++i)
		{
			for (int j = 0; j < 4; ++j)
			{
				res.push_back(*this);
				roll_z();
			}
			if (i & 1) roll_y();
			else roll_x();
		}
		return res;
	}
};
typedef TDice<int> Dice;

int main()
{
	Dice hoge;
	vector<Dice> all_pat = hoge.all_rolls();

	int n;
	while (cin >> n, n)
	{
		int top_num[256][256];
		int h[256][256];
		CL(h, 0);

		const int cx = 100, cy = 100;

		while (n--)
		{
			int top, front;
			cin >> top >> front;
			Dice Dice;
			for (int i = 0; i < all_pat.size(); ++i)
				if (all_pat[i][TOP] == top && all_pat[i][FRONT] == front)
					Dice = all_pat[i];
			
			const int dx[] = { 0, 1, 0, -1 };
			const int dy[] = { 1, 0, -1, 0 };
			const Face f[] = { FRONT, RIGHT, BACK, LEFT };

			int x = cx, y = cy;
			for (;;)
			{
				int dir = -1, max_num = 3;
				for (int i = 0; i < 4; ++i)
				{
					int tx = x + dx[i], ty = y + dy[i];
					if (h[ty][tx] < h[y][x] && Dice[f[i]] > max_num)
						dir = i, max_num = Dice[f[i]];
				}

				if (dir == -1)
				{
					top_num[y][x] = Dice[TOP];
					++h[y][x];
					break;
				}

				x += dx[dir];
				y += dy[dir];

				if (dir == 0)
					Dice.roll_x();
				else if (dir == 1)
					Dice.roll_y();
				else if (dir == 2)
					Dice.rev_roll_x();
				else if (dir == 3)
					Dice.rev_roll_y();
			}
		}

		int res[8];
		CL(res, 0);
		for (int y = 0; y < 256; ++y)
			for (int x = 0; x < 256; ++x)
				if (h[y][x] > 0)
					++res[top_num[y][x]];

		for (int i = 1; i <= 6; ++i)
			cout << res[i] << (i == 6 ? '\n' : ' ');
	}
}

Measured memory_bytes: 0