0385

#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>


using namespace std;



int main() {
    int n;
    cin >> n;
    set<int> s;
    vector<int> c;
    vector<int> vec(n);
    vector<int> x;
    vector<vector<int>> y;
    for (int i = 0; i < n; i++) {
        int m;
        cin >> m;
        vec.push_back(m);
        c.push_back(m);
        c.push_back(0);
        s.insert(m);
        y.push_back(c);
        c.clear();
    }
    copy(s.begin(), s.end(), back_inserter(x));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++){
            if (x[i] == c[j][0]) { c[j][1]++; }
        }
    }

}