Codeforces Round #379 (Div. 2) A. Anton and Danik 水题

A. Anton and Danik

题目连接：

http://codeforces.com/contest/734/problem/A

Description

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

Sample Input

6

ADAAAA

Sample Output

Anton

Hint

题意

问你A多，还是D多，然后输出谁赢谁输

题解：

签到题

代码

#include<bits/stdc++.h>
using namespace std;

string s;
int main()
{
    cin>>s;
    cin>>s;
    int a=0,b=0;
    for(int i=0;i<s.size();i++)
        if(s[i]=='A')a++;
        else b++;
    if(a>b)puts("Anton");
    else if(a==b)puts("Friendship");
    else puts("Danik");
}