Help! who will help me?

[jolly]

if you can do it, help me!;]

[mod: English is the official language of this forum]

Input

a line with integer n (n<=1000000); a line with a string consisting of exactly n ASCII characters.

Output

the character which appears in the text most often (with the smallest ASCII value, in case of a tie).

Example

Input:
10
abcdataraa
Output:
a

[chaotic]

i may be wrong, but i think bucketsort would be the appropriate approach.
if you dont know how to implement it, you can drop me a PM.

[sparr0]

well, i started to type this as pseudocode but it turns out it might be valid (GNU) C++

main()
{
  int s[]={[0 ... 255] = 0}, n, c, m=0, b;
  cin>>n;
  while(n--)
    if ((++s[c=getchar()])>m || (s[c]==m && c<b))
      m=s[b=c];
  cout<<(char)b;
}

i didnt test it, so it probably wont work, but thats my 60-seconds-worth of answer

(edit: 62 seconds. i forgot to cast b to char for the cout)