#danglam228

program tt;

var
  n, i, j, count, e: Integer;
  a, f: array of Integer;
  r: Integer;
  found: Boolean;

begin
  ReadLn(n);
  SetLength(a, n);
  for i := 0 to n - 1 do
    Read(a[i]);
  e := 0;   
  f := a[0]; 
  for i := 0 to n - 1 do
  begin
    count := 0;
    for j := 0 to n - 1 do
    begin
      if a[j] = a[i] then
        Inc(count);
    end;
    if count > e then
    begin
      e := count;
      f := a[i];
    end;
  end;
  WriteLn(f);
  WriteLn(e);
  SetLength(f, n); 
  f[0] := a[0];
  r := 1; 
  for i := 1 to n - 1 do
  begin
    found := False;
    for j := 0 to r - 1 do
    begin
      if a[i] = f[j] then
      begin
        found := True;
        Break;
      end;
    end;
    if not found then
    begin
      f[r] := a[i];
      Inc(r);
    end;
  end;
  for i := 0 to r - 1 do
    Write(f[i], ' ');
  WriteLn;
end.

var a:array[1..10000] of int64;
    n,m,f,c:int64;
    i,j:longint;
    ok:boolean;
begin
  readln(n);
  for i:=1 to n do
    read(a[i]);
  m:=0;
  for i:=1 to n do
  begin
    c:=0;
    for j:=1 to n do
      if a[j]=a[i] then
        c:=c+1;
    if c>m then
    begin
      m:=c;
      f:=a[i];
    end;
  end;
  writeln(f);
  writeln(m);
  for i:=1 to n do
  begin
    ok:=false;
    for j:=1 to i-1 do
      if a[j]=a[i] then
      begin
        ok:=true;
        break;
      end;
    if not ok then
      write(a[i],' ');
  end;
  writeln;
end.