def migratoryBirds(arr):
    count = {}
    for n in arr:
        if n not in count:
            count[n] = 0
        count[n] += 1
        
    maxval = max(count.values())
    
    best = []
    for key, val in count.items():
        if val == maxval:
            best.append(key)             

    return min(best)