class Solution {
    public int maxCoins(int[] piles) {
        int n=piles.length/3;
        int count=0;
        Arrays.sort(piles);
        for(int i=piles.length-2; n-- >0; i-=2){
            count+=piles[i];
        }
        return count;
    }
}