TheForces Round #9 (Fool-Forces)
A. Vowels
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Welcome to our foolish round, We hope you enjoy the problems, Only those who are fool can solve the problems!

You'll be given a string, Find the answer and print it.

Input

In the first line you'll get a string of lowercase English letters.

$$$1 \le |s| \le 100$$$.

Output

Print a single integer.

Examples
Input
abue
Output
3
Input
amir
Output
2
Input
qwsdr
Output
0

B. String
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You're given a string of length $$$n$$$, Print the answer modulo $$$10^9 + 7$$$.

Input

A string of length $$$n$$$ will be given.

$$$1 \le n \le 10^5$$$.

Output

Print the answer modulo $$$10^9 + 7$$$.

Examples
Input
8
aaaaaaaa
Output
1
Input
10
tttttttttt
Output
999928327
Input
2
ab
Output
2
Input
2
cd
Output
12

C. Morco
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
.-.. .. ...

You're given an array of integers of length $$$n$$$, Find the answer.

Input

In the first line of input, You'll be given $$$n(1 \le n \le 10^5)$$$.

In the second line of input, You'll be given an array $$$a(1 \le a_{i} \le 10^9)$$$.

Output

Print the answer.

Example
Input
3
1 2 3
Output
3

D. TheFool
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Input

The input contains two integers $$$row$$$, $$$col$$$ ($$$0 \le row, col \le 14$$$), separated by a single space.

Output

Output "IN" or "OUT".

Examples
Input
0 0
Output
IN
Input
6 0
Output
OUT

E. Permutation
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

This problem's statement is secret :

"uoY'er viegn na raayr fo itnsereg, dnif hte cesdno tslmlesa etelmne fo het rraya nad irtpn ti".

Input

In the first line of input, You'll be given $$$n(2 \le n \le 100)$$$.

In the second line of input, You'll be given an array $$$a(2 \le a_{i} \le 100)$$$.

Output

Print the answer.

Example
Input
8
2 3 5 7 13 17 19 23
Output
3

F. Online
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Input

$$$-69 \le x \le 69$$$.

Output

Answer will be a number $$$y$$$ which $$$-4676 \le y \le 4846$$$.

Examples
Input
0
Output
85
Input
1
Output
16

G. Simple
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You're given a number $$$n$$$, Print the answer.

Input

$$$1 \le n \le 2023$$$.

Output

Print a single integer.

Examples
Input
6
Output
6
Input
12
Output
1
Input
1000
Output
3
Input
2
Output
2
Input
100
Output
5

H. Best
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
TheForces rounds are the best rounds ever.
Input

You will be given a number.

Output

Print the answer.

Examples
Input
1
Output
84
Input
10
Output
32