#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P) 
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }



int n;

vint op(vint vec) {
    map<int,int> ma;
    for (int i = 0; i < vec.size(); ++i) ma[vec[i]]++;
    vint res(vec.size());
    for (int i = 0; i < vec.size(); ++i) res[i] = ma[vec[i]];
    return res;
}

int main() {
    while (cin >> n) {
        if (n == 0) break;
        vint vec(n);
        for (int i = 0; i < n; ++i) cin >> vec[i];
        int res;
        for (res = 0; res < 1000000; ++res) {
            vint nvec = op(vec);
            if (nvec == vec) break;
            vec = nvec;
        }
        cout << res << endl;
        for (int i = 0; i < n; ++i) {
            cout << vec[i];
            if (i != n-1) cout << " ";
        }
        cout << endl;
    }
    return 0;
}
