Anton and Danik

Anton和Danik玩了n局游戏，求谁赢得更多 输入：第一行为n，表示局数 第二行为每局获胜情况，A表示Anton赢，D表示Danik赢 输出： 谁赢输出谁的名字，打平输出“Friendship”（不输出引号） 感谢@Gavin帅 提供的翻译

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.

The first line of the input contains a single integer $ n $ ( $ 1<=n<=100000 $ ) — 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.

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).

6
ADAAAA

Anton

7
DDDAADA

Danik

6
DADADA

Friendship

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".