ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules

Ural Championship 2004 Round 1

About     Problems     Submit solution     Judge status     Standings
Contest is over

A. Archiver

Time limit: 1.0 second
Memory limit: 4 MB
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++).

Input

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.

Output

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

Sample

input
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
output
//CPP
#include<iostream.h>
int main()
{for(int i=1;i<58;i++)cout<<i;return 0;}

Notes

The sample input is just an illustration, it does not satisfy the requirements since it is too short and not a literary text.
Problem Author: Idea - Leonid Volkov, prepared by Pavel Egorov and Leonid Volkov
Problem Source: VIII Collegiate Students Urals Programming Contest. Yekaterinburg, March 11-16, 2004
To submit the solution for this problem go to the Problem set: 1307. Archiver