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

Yet another foolish heforces round.

Examples
Input
Which contests are the best contests made by people?
Output
TheForces rounds!
Input
What?
Output
TheForces rounds!
Input
Where?
Output
TheForces rounds!
Input
Who?
Output
TheForces rounds!

B. Smaller than 100
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

There were $$$17$$$ Theforces rounds, but sometimes the number of contestants is small.

Input

You'll be given only one string "We're growing alone!".

Output

Print a single integer, the answer to the proble.

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

The only line of the input contains a string of digits. The length of the string is between $$$1$$$ and $$$100$$$, inclusive.

Output

Print "Yes" or "No", You can output each letter in any case (lowercase or uppercase). For example, the strings "yEs", "yes", "Yes" and "YES" will be accepted as a positive answer.

Examples
Input
5
Output
YES
Input
43
Output
NO
Input
76
Output
NO
Input
10
Output
NO
Input
37
Output
YES

D. Missing Characters
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
  • Mr. Soltan : We can ask people to print the concatenation of the answers to the problems $$$B, A, D$$$
  • Mr. Shekarchi : What if we do this with some words of the statements of the tasks $$$B, A$$$ and $$$D$$$?
  • Mr. Pupak : eah, this is better 😈
Input

In the first line of input, you'll be given the only string "BAD problem".

Output

Print the answer.

It's guaranteed that the answer does not depend on the input and it is an unique string.

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

You'll be given a number $$$t$$$ which shows the number of test cases.

$$$$$$1 \le t \le 10^4$$$$$$

For each test case you will receive a single string of lowercase latin letters $$$s$$$.

$$$$$$1 \le |s| \le 2 \cdot 10^5$$$$$$

It's guaranteed that sum of lengths over all test cases does not exceed $$$2 \cdot 10^5$$$.

Output

For each test case, print one integer $$$-$$$ the answer.

Example
Input
25
cringe
cringecringe
ccrriinnggee
aaaaaaaaaaaaaaaa
bbbbbbbbbbbbbbbb
djjj
jdjj
jjdj
jjjd
lettersum
kirito
abcdef
impossible
orzorzorzorzorzorz
divide
codeforces
codechef
leetcode
atcoder
theforces
minecraft
modten
sahidhsdbfsdoftbfhg
groitoeortgdnfgjjniub
crineorngoeirndofgmd
Output
1
2
2
0
0
1
1
1
1
1
1
0
1
3
0
1
1
1
0
1
1
0
3
3
3

F. Rt Dg
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

If you warm up before an action, you will have a high °C.

Input

You will be given $$$n - 1$$$ edges.

$$$$$$3 \le n \le 1000$$$$$$

Output

Print the answer.

Example
Input
3
1 2
2 3
Output
1

G. Qpert pg yep
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Upi str hobrm s miznrt $$$m$$$, qtomy yjr smdert.

Input

$$$$$$1 \le m \le 10^9$$$$$$

Output

Qtomy s domhar omyrhrt.

Examples
Input
1
Output
1
Input
2
Output
2
Input
5
Output
6
Input
4
Output
8
Input
7
Output
4

H. Random Generator
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

The jury checks if your code's output is the same with the jury's answer or not, so submit as many as you can!

Input

You will be given a string in the input.

Output

Print a number.