#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    auto f = [](vector<int> v){
        map<int, int> m;
        for (auto &&i : v) m[i]++;
        for (auto &&i : v) i = m[i];
        return v;
    };
    int n;
    while(cin >> n, n){
        vector<int> v(n);
        for (auto &&i : v) scanf("%d", &i);
        int ans = 0;
        while(true){
            auto u = f(v);
            if(u == v) break;
            v = u;
            ans++;
        }
        cout << ans << "\n";
        for (int i = 0; i < n; ++i) {
            if(i) printf(" ");
            printf("%d", v[i]);
        }
        puts("");
    }
    return 0;
}
