It is custom to start each problem given at a programming contest with a 'tale', in order to link the problem to the real world as well as to fog its essence, especially if the essence seems too easy to understand. But this problem has no tale, because, first, it is quite unusual, and, second, the problem itself is about brevity.

Suppose that we are given a text. An archive of this text is a text satisfying the following requirements:

1. An archive is a program in one of the programming languages allowed by the rules of the contest.
2. The first line of the archive is “{PAS}”, or “/*C*/”, or “//CPP”.
3. After compiling and executing an archive, we obtain the original text.
4. The length of an archive is strictly less than the length of the original text.

You should write a program that outputs an archive for a given text. The archive is compiled and executed with the same parameters and restrictions that are used for compiling and executing the submitted program containing the solution of the problem. The archive might not to be in the same language as a generating it solution. Checking the problem the judges determines the archive language according to the first line («{PAS}» — Pascal/Delphi, «/*С*/» — С, «//CPP» — C++).

The input contains a text of length not less than 20000 and not more than 200000 symbols. The text may contain capital and lower-case English letters, digits, punctuation signs, line breaks, and quotation marks. It is guaranteed that all the texts used as tests for this problem are literary texts in English.

You should output an archive of the text given in the input.

The sample input is just an illustration, it does not satisfy the requirements since it is too short and not a literary text.