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* ≤ 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.
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".
6
ADAAAA
Anton
7
DDDAADA
Danik
6
DADADA
Friendship
10
DDDDADDADD
Danik
40
AAAAAAAAADDAAAAAAAAAAADADDAAAAAAAAAAADAA
Anton
200
DDDDDDDADDDDDDAADADAADAAADAADADAAADDDADDDDDDADDDAADDDAADADDDDDADDDAAAADAAADDDDDAAADAADDDAAAADDADADDDAADDAADAAADAADAAAADDAADDADAAAADADDDAAAAAADDAADAADAADADDDAAADAAAADADDADAAAAAADADADDDADDDAADDADDDAAAAD
Friendship
1
A
Anton
1
D
Danik
2
DA
Friendship
4
DADA
Friendship
4
DAAD
Friendship
3
ADD
Danik
3
DAD
Danik
2
DA
Friendship
379
AADAAAAAADDAAAAAADAADADADDAAAAADADDAADAAAADDDADAAAAAAADAADAAAAAAADAAAAAAAAADAAAAAAADAAAAAAAAAAADDDADAAAAAAAADAADADAAAADAAAAAAAAAAAAAAAAADAAAADDDAADAAAAAAADAAADAAADAADDDADDAAADAAAAAADDDADDDAAADAAAADAAAAAAAAADAAADAAAAAAAAADAAAAAAAAAAAAAAAAAADADAAAAAAAAAAADAAAAADAAAADAAAAAAAAAAAAADADAADAAAAAAAADAADAAAAAAAADAAAAAAAADDDAAAAAADAAADAAAAAADAADAAAAAADAAAADADAADAAAAAADAAAADAADDAADAADAAA
Anton
n = int(input())
b = list(map(int, input().split()))
c = list(map(int, input().split()))

total_sum = sum(b) + sum(c)
if total_sum % (2 * n):
    print(-1)
else:
    target_sum = total_sum // (2 * n)
    ans = [(b[i] + c[i] - target_sum) // n for i in range(n)]
    
    cnt = [0] * 32
    for a in ans:
        for j in range(32):
            cnt[j] += (a >> j) & 1
    
    f = all(sum((1 << j) * cnt[j] for j in range(32) if ans[i] & (1 << j)) == b[i] and
            (sum(n * (1 << j) if ans[i] & (1 << j) else cnt[j] * (1 << j) for j in range(32)) == c[i] for i in range(n))
    
    if f:
        print(*ans)
    else:
        print(-1)
