class Solution {
public:
int edgeScore(vector<int>& edges) {
int n=edges.size();
vector<long long> sum(n);
long long maxsum=0;
for(int i=0;i<n;i++)
{
sum[edges[i]]+=i;
maxsum=max(maxsum,sum[edges[i]]);
}
int id=0;
while(id<n)
{
if(sum[id]==maxsum) break;
id++;
}
return id;
}
};