def find_Diff(arr,n):
     
    arr.sort()  
    count = 0; max_count = 0; min_count = n 
    for i in range(0,(n-1)): 
        if arr[i] == arr[i + 1]: 
            count += 1
            continue
        else: 
            max_count = max(max_count,count) 
            min_count = min(min_count,count) 
            count = 0
    return max_count - min_count 
def find_Diff(arr, n):
    arr.sort()
    diff = 0
max_count = 0
min_count = n
for i in range(0, (n - 1)):
    if arr[i] == arr[i + 1]:
        diff += 1
       
        continue
    else:
        max_count = max(max_count, diff)
        min_count = min(min_count, diff)
        diff = 0
return max_count - min_count