#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define Cout(x) cout << (x) << endl
#define Cout2(x, y) cout << (x) << " " << (y) << endl
#define dump(x) cout << #x << " = " << (x) << endl;
#define forauto(i, a) for(auto i : a)cout << i << " "; puts("");
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
const int inf = 1e9;
const double pi = acos(-1.0);

VI convi(int n, VI a) {
	VI ret(n);
	VI memo(101, -1);

	rep(i, n) {
		if (memo[a[i]] == -1) {
			int cnt = count(all(a), a[i]);
			ret[i] = cnt;
			memo[a[i]] = cnt;
		}
		else {
			ret[i] = memo[a[i]];
		}
	}

	return ret;
}

bool endCheck(VI a) {
	return a == convi(sz(a), a);
}

int main() {
	int n;
	while (cin >> n && n) {
		VI a(n); rep(i, n)cin >> a[i];

		int ans = 0;
		while (!endCheck(a)) {
			a = convi(n, a);
			ans++;
		}

		Cout(ans);
		rep(i, n)cout << a[i] << (i == n - 1 ? "\n" : " ");
	}
}
