#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
#include <set>
#include <iostream>
#include <map>
#include <functional>
#include <cstdlib>
#include <numeric>
#include <queue>
#include <complex>
#include <sstream>
#include <stack>

using namespace std;

#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef complex<double> Point;

int main()
{
	int n;
	while(scanf("%d", &n), n){
		vi array(n);
		rep(i, n)
			scanf("%d", &array[i]);

		int cnt;
		for(cnt=0;; ++cnt){
			vi tmp(n, 0);
			rep(i, n) rep(j, n)
				tmp[i] += array[i] == array[j];
			bool changed = false;
			rep(i, n){
				if(array[i] != tmp[i]){
					changed = true;
					array[i] = tmp[i];
				}
			}
			if(!changed)
				break;
		}
		printf("%d\n", cnt);
		rep(i, n)
			printf("%s%d", i?" ":"", array[i]);
		puts("");
	}
	return 0;
}