////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <regex>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a)/sizeof(a[0]))

#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define pos(c,i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a,i,n) a + (i), a + (i) + (n)
#define long long long

#define EPS 1e-9
#define INF (1L << 30)
#define LINF (1LL << 60)

#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }
#define CONVERTER(TSrc,t,TDest,exp) [&](const TSrc &t)->TDest { return exp; }

inline int sign(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }
inline bool inRange(int val, int min, int max) { return val >= min && val < max; }
inline bool inRange(double val, double min, double max) { return val - min > -EPS && val - max < EPS; }
template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };
inline bool contains(int x, int y, int W, int H) { return x >= 0 && x < W && y >= 0 && y < H; } // W,H含まない

//// i/o helper ////

#ifdef _DEBUG
#define DEBUG WRITE
inline void readfrom(string filename) { freopen(filename.c_str(), "r", stdin); }
inline void writeto(string filename) { freopen(filename.c_str(), "w", stdout); }
#else
#define DEBUG(...)
inline void readfrom(...) { }
inline void writeto(...) { }
#endif
#ifdef ccout
#  define cout ccout
#  define endl cendl
#endif

struct _Reader { template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { bool f; _Writer() : f(false) { } template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; _Reader(), __VA_ARGS__
#define WRITE(...) _Writer(), __VA_ARGS__; cout << endl

template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vevector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T1, class T2> inline istream & operator >> (istream & in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
template <class T1, class T2> inline ostream & operator << (ostream &out, pair<T1, T2> &p) { out << p.first << p.second; return out; }
template <class T> inline ostream & operator << (ostream &out, const vector<T> &v)
{
	ostringstream ss;
	for (auto x : v) ss << x << ' ';
	auto s = ss.str();
	out << s.substr(0, s.length() - 1);
	return out;
}

//// start up ////
void solve();


int main()
{
	solve();
	return 0;
}


// さいころ
template<class T>
union Die
{
	/* v as 天一地六東五西二南三北四
	|3|
	|1|0|4|5|
	|2|
	*/
	T v[6];
	struct { T top, left, front, back, right, bottom; };

	void rt(int x, int y, int z, int w) { swap(v[x], v[y]); swap(v[x], v[z]); swap(v[x], v[w]); }

	// ※ 上から見てどっちへ倒すか
	void rotateLeft() { rt(1, 5, 4, 0); }
	void rotateRight() { rt(0, 4, 5, 1);  }
	void rotateDown() { rt(2, 5, 3, 0);  }
	void rotateUp() { rt(0, 3, 5, 2); }
	void rotateCw() { rt(4, 2, 1, 3); }
	void rotateCcw() { rt(3, 1, 2, 4); }
	bool operator < (const Die &rhs) const { return lexicographical_compare(aallof(v), aallof(rhs.v)); }
	bool operator == (const Die &rhs) const { return equal(aallof(v), rhs.v); }
	bool operator != (const Die &rhs) const { return !equal(aallof(v), rhs.v); }
	void dump() { DEBUG("", back, '\n', left, top, right, bottom, '\n', front); }

	template <typename U>
	void enumerateRotation(U callback) const
	{
		Die x = *this;
		REP(i, 3)
		{
			callback(x); x.rotateCw();
			callback(x); x.rotateCw();
			callback(x); x.rotateCw();
			callback(x); x.rotateCw(); x.rotateRight();
			callback(x); x.rotateCw();
			callback(x); x.rotateCw();
			callback(x); x.rotateCw();
			callback(x); x.rotateCw(); x.rotateDown();
		}
	}

};

////////////////////
/// template end ///
////////////////////

void solve()
{
	typedef Die<int> XI;
	vevector<XI> initTable(7, 7);
	{
		XI xi = { { 1, 2, 3, 4, 5, 6 } };
		xi.enumerateRotation([&](XI xi){ initTable[xi.top][xi.front] = xi; });
	}

	int testcases = INF;
	REP(testcase, testcases)
	{
		READ(int, n);
		if (!(n)) break;

		vevector<int> heights(201, 201);
		vevector<int> topValue(201, 201);
		vector<int> topCount(6);
		REP(i, n)
		{
			READ(int, t, f);
			XI xi = initTable[t][f];

			int x = 100, y = 100;
			while (true)
			{
				xi.dump();
				
				// 転がる？
				RFOR(i, 4, 7)
				{
					if (xi.back == i && heights[x][y - 1] < heights[x][y]) { y--; xi.rotateUp(); goto next; }
					if (xi.front == i && heights[x][y + 1] < heights[x][y]) { y++; xi.rotateDown(); goto next; }
					if (xi.left == i && heights[x - 1][y] < heights[x][y]) { x--; xi.rotateLeft(); goto next; }
					if (xi.right == i && heights[x + 1][y] < heights[x][y]) { x++; xi.rotateRight(); goto next; }
				}

				// 位置決まった
				heights[x][y]++;
				if (topValue[x][y]) { topCount[topValue[x][y] - 1]--; }
				topValue[x][y] = xi.top;
				topCount[xi.top - 1]++;
				break;

			next:;
			}
		}
		WRITE(topCount);
	}
}

Measured memory_bytes: 1532