func initAcumulator() []int32 {
    var numAcumulator []int32
    
    for i := 0; i < 5; i++ {
        numAcumulator = append(numAcumulator, 0)    
    }
    return numAcumulator
}

func findBiggest(accumulator []int32) int32 {
    var max int32
    var result int32
    
    for i, e := range accumulator {
        if e > max {
            result = int32(i)
            max = e
        }
    }
    return result + 1
}

func migratoryBirds(arr []int32) int32 {
    // Write your code here
    accumulator := initAcumulator()
    
    for _, e := range arr {
        accumulator[e-1]++
    }
    
    return findBiggest(accumulator)
}

    public static int migratoryBirds(List<Integer> arr) {
    // Write your code here
        Map<Integer, Integer> countMap = new HashMap<>();
        
        for (Integer num : arr) {
            if (Objects.isNull(countMap.get(num))) {
                countMap.put(num, 0);
                continue;
            }
            
            int value = countMap.get(num);
            countMap.remove(num);
            countMap.put(num, ++value);
        }
        
        int max = 0;
        int res = 0;
        for (Map.Entry<Integer, Integer> entry : countMap.entrySet()) {
            if (entry.getValue() > max) {
                max = entry.getValue();
                res = entry.getKey();
            }
        }
        
        return res;
    }

 

 int frequancyarray2(int arr_count, int* arr){
     int max= 0 , maxvalue ; 
      int * data = (int*)calloc(6 , sizeof(int));
      for(int i = 0 ; i <= 5; i ++){
          data[i]=0 ;
      }
      for (int i = 0 ; i < arr_count ; i ++){
          data[arr[i]] ++ ; 
      }
      max = data[0];
      maxvalue= 0 ;
      for (int i = 1 ; i <= 5 ; i ++){
         if (data[i] > max){
             max = data[i] ;
             maxvalue = i ;
         } 
      }
      free (data);
   return maxvalue;   
 }

int migratoryBirds(vector<int> arr) {
    map<int, int> map;
    for(int i : arr){
        map[i]++;
    }
    int largest = 0;
    int bird;
    for(auto i : map){
        if(i.second > largest){
            largest = i.second;
            bird = i.first;
        }
    }
    int temp = 0;
    for(auto i : map){
        if(i.second == largest){
            temp++;
        }
    }
    if(temp > 1){
        for(auto i : map){
            if(i.second == largest){
                if(i.first < bird){
                    bird = i.first;
                }
            }
        }
    } 
    return bird;
}