/* output most times of occurence */
public static void timesTopN(int[] arr){
int l=arr.length;
int[] times=new int[l];
Arrays.fill(times,1);
for(int i=0;i<l;i++)
for(int j=i+1;j<l;j++)
if(arr[i]==arr[j]) times[i]++;
int[] timesTemp=copyArr(times);
int fromIndex=topN(timesTemp,1)[0];
int max=times[maxArr(times)];
System.out.print(arr[fromIndex]);
for(int i=fromIndex+1;i<l;i++)
if(times[i]==max) System.out.print(","+arr[i]);
System.out.println();
}
public static void timesTopN(int[] arr){
int l=arr.length;
int[] times=new int[l];
Arrays.fill(times,1);
for(int i=0;i<l;i++)
for(int j=i+1;j<l;j++)
if(arr[i]==arr[j]) times[i]++;
int[] timesTemp=copyArr(times);
int fromIndex=topN(timesTemp,1)[0];
int max=times[maxArr(times)];
System.out.print(arr[fromIndex]);
for(int i=fromIndex+1;i<l;i++)
if(times[i]==max) System.out.print(","+arr[i]);
System.out.println();
}