Problem Statement  
You are given a list of numbers in a int[] n. A number k is a factor of number m if m can be exactly divided into k. Find the factor greater than 1 that is shared by the most elements in n. If there are several such factors, return the largest one among them.  
Definition  
 
Constraints  
  n will contain between 1 and 50 elements, inclusive.  
  Each element of n will be between 2 and 1000000000, inclusive.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
 
4)  
 
5)  
 
6)  
 
7)  
