#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;

int n, s[100], k[100];

int main(){
	while (cin >> n&&n){
		REP(i, n){
			cin >> s[i];
		}
		int num = 0;
		bool f = 1;
		while (f){
			int co[100] = {};
			REP(i, n){
				k[i] = s[i];
				co[s[i]]++;
			}
			REP(i, n){
				s[i] = co[s[i]];
			}
			REP(i, n){
				if (s[i] != k[i])break;
				if (i == n - 1){
					f = 0; num--;
				}
			}
			num++;
		}
		cout << num << endl;
		REP(i, n){
			i == n - 1 ? cout << s[i] << endl : cout << s[i] << " ";
		}
	}
}