class Solution {
public:
    int largestUniqueNumber(vector<int>& A) {
        map<int,int>F;
        for(auto p:A)
        F[p]++;
        for(auto ia=F.rbegin();ia!=F.rend();ia++)
        if(ia->second==1)return ia->first;
        return-1;
    }
};