#Write a function no$\_$mode that takes as argument a list of ints.

#Find the int that appears most frequently in the list

#Create a new list with the same contents

#Remove all instances of the most$-$frequently$-$occurring int

#Returns the new list.

#You can assume that one number will appear more than the others.

#no$\_$mode$([1,3,1,6,2])$ returns $[3,6,2]$

#no$\_$mode$([4,5,0,0])$ returns $[4,5]$

#no$\_$mode$([1,1,2,2,2])$ returns $[1,1]$

#Submit as no$\_$mode.py