Problem Description

Rar the Cat has found some files on his computer and decides to set a problem on it! For this problem, there will be a archive file containing the files required for each subtask. Each subtask is graded separately and requires you to follow different instructions.

Subtask 1

Rar the Cat has 20 files 01.in till 20.in. Each file contains integers, one per line. These integers range from 0 to 1018. For each file, Rar the Cat wants you to find an integer X such that X does not exist in the file but there is another integer Y such that X < Y which exists in the same file. Rar the Cat likes big numbers, so he wants X to be as large as possible.

Input

Each of the 20 files will contain multiple lines, each with a single integer from 0 to 1018.

Output

For each file, output a single integer, X as described above. Start with the value for 01.in till 20.in, one on each line.

Scoring

This subtask has 40% weightage. Each correct integer will gain you 2%.

Subtask 2

Rar the Cat has 200 files named randomly. Each of these file contain a single string comprising of lowercase alphabets. Rar the Cat wants you to sort them by the length of the string and print the file names in increasing length of the string they contain. It is guaranteed that there will be no 2 files with the same string length.

Input

Each of the 200 files will contain a single string made of lowercase alphabets.

Output

Output the file names in increasing length of the string they contain. One filename per line. Do include the file extension. (Eg: ahskd.txt).

Scoring

This subtask has 30% weightage. You will only get full score if your answer is fully correct.

Subtask 3

Rar the Cat has 2000 files named as 16 lowercase alphabets (Eg: abcdefghijklmnop). Each of these files will contain a string comprising of 16 lowercase alphabets as well. Rar the Cat wants to know which files contain strings that are anagrams with their file name.

As a recap, 2 strings are considered anagram if they have the same number of every letter.

Input

Each of the 2000 files will contain a single 16 character string, comprising of lowercase alphabets.

Output

Output the file names which are anagrams with the string they contain. One filename per line.

Scoring

This subtask has 30% weightage. You will only get full score if your answer is fully correct.