A. The Anadaryy Tragedy
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Basti is known for never answering any question directly. Whenever someone asks him something, he only says the word Anadaryy and leaves the rest to Belal.

After answering far too many questions himself, Belal became frustrated and decided to ask Basti the hardest question of all time.

But before that, Belal had a strange habit: every day, he counted all the characters Basti had spoken, then wrote them down in a completely random order.

Now Belal gives Basti this shuffled collection of characters. These characters represent everything Basti said during the day. Since Basti only says Anadaryy, Belal wants to know how many times Basti could have said that word.

Each time you form the word Andaryy, you must remove exactly one occurrence of each of its characters from the given collection.

Your task is to determine the maximum number of times the word Anadaryy can be formed.

Input

The first line contains a single integer $$$n$$$ $$$(1 \le n \le 2 \cdot 10^5)$$$ — the number of characters in the collection.

The second line contains a string $$$s$$$ of length $$$n$$$, consisting of English letters, representing the given characters in random order.

Output

Print a single integer — the maximum number of times the word Anadaryy can be formed.

Examples
Input
16
AAnnaaddaarryyyy
Output
2
Input
12
ybAradnyxqAa
Output
1