import java.util.*;
import java.io.PrintStream;

public class StupidSort {

 public static final long SHIFT = Integer.MIN_VALUE;
 public static final long MULT = Integer.MIN_VALUE*-2l;

 public static long[] sortByCount(int[] a) {
  if ((a==null)||(a.length==0)) return new long[0];
  Arrays.parallelSort(a);
  final int l= a.length;
  long[] r = new long[l];
  int j=0;
  r[j] = a[j]+SHIFT;
  for (int i=1;i<l;i++) {
   if (a[i]==a[j]) {
    r[j] -=MULT;
   } else {
    r[++j] = a[i]+SHIFT;
   }
  }
  long[] res = new long[++j];
  System.arraycopy(r, 0, res, 0, j );
  Arrays.parallelSort(res);
  return res;
 }

 public static void printResult(long[] a, PrintStream o) {
  o.println("Result is:");
  if ((a==null)||(a.length==0)) return;
  for (long l : a) {
   long cn = (l&0xFFFFFFFF00000000l)/-MULT;
   if (cn==0) break;
   o.print("Value :");
   o.print ((int)(l+SHIFT));
   o.print(" count :");
   o.println(cn);
  }
 }

 public static void main(String[] argv) {
  printResult(sortByCount(new int[]{0,0,1,-1,Integer.MAX_VALUE,Integer.MIN_VALUE,Integer.MIN_VALUE,Integer.MIN_VALUE}), System.out);
 }

}

int c = a[j];
  r[j] = a[j]+SHIFT;
  for (int i=1;i<l;i++) {
   if (a[i]==c) {
    r[j] -=MULT;
   } else {
    c=a[i];
    r[++j] = c+SHIFT;
   }
  }