Codeforces Round 379 (Div. 2)
A
Anton and Danik
Codeforces
800
原题
←B →
翻译中…

Anton likes to play chess, and so does his friend Danik.

翻译中…

Once they have played $*n*$ games in a row. For each game it's known who was the winner — Anton or Danik. None of the games ended with a tie.

翻译中…

Now Anton wonders, who won more games, he or Danik? Help him determine this.

翻译中…

Input

翻译中…

The first line of the input contains a single integer $*n*$ ($1 ≤ *n* ≤ 100 000$) — the number of games played.

翻译中…

The second line contains a string $*s*$, consisting of $*n*$ uppercase English letters 'A' and 'D' — the outcome of each of the games. The $*i*$-th character of the string is equal to 'A' if the Anton won the $*i*$-th game and 'D' if Danik won the $*i*$-th game.

翻译中…

Output

翻译中…

If Anton won more games than Danik, print "Anton" (without quotes) in the only line of the output.

翻译中…

If Danik won more games than Anton, print "Danik" (without quotes) in the only line of the output.

翻译中…

If Anton and Danik won the same number of games, print "Friendship" (without quotes).

翻译中…

Note

翻译中…

In the first sample, Anton won $6$ games, while Danik — only $1$. Hence, the answer is "Anton".

翻译中…

In the second sample, Anton won $3$ games and Danik won $4$ games, so the answer is "Danik".

翻译中…

In the third sample, both Anton and Danik won $3$ games and the answer is "Friendship".

翻译中…

样例

Input #1
6
ADAAAA
Output #1
Anton
InputCopy OutputCopy
Input #2
7
DDDAADA
Output #2
Danik
InputCopy OutputCopy
Input #3
6
DADADA
Output #3
Friendship
InputCopy OutputCopy
题目信息
题号
734A
时间限制
1 s
内存限制
256 MB
标签
模拟
字符串

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。