题库练习 Anton and Danik
← 上一题 下一题 →

A10570 | Anton and Danik

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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

输入输出样例

输入 #1
6
ADAAAA
输出 #1
Anton
输入 #2
7
DDDAADA
输出 #2
Danik
输入 #3
6
DADADA
输出 #3
Friendship
C++ 编辑器
输入
输出