}
    sort(v+1, v+1+n);
    pa.push_back(make_pair(v[1].first, 1));
    v[1].first = 1;
    for (i = 2; i <= n; i++)
    {
        if (pa.front().first + d <= v[i].first)
        {
            int grecu = pa.front().first;
            j = pa.front().second;
            pa.pop_front();
            pa.push_back(make_pair(v[i].first, j));
            v[i].first = j;
            continue;
        }
        pa.push_back(make_pair(v[i].first, ++big));
        v[i].first = big;
    }
    sort(v+1, v+1+n, retard);
    out << big << '\n';
    for (i = 1; i <= n; i++)
        out << v[i].first << '\n';
    return 0;
}