CF734A.Anton and Danik

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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
```

说明/提示

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

首页