eolymp
bolt
Try our new interface for solving problems
Problems

Stringorial

Stringorial

Rabbit Bryan is a romantic person. He likes to dream about wonderful things. Recently he dreamed that stings are similar to numbers... "\textit{But we can add it!}" -- realized Bryan, than thought again and decided that he can multiply it!!! For example, let’s multiply 2 strings \textbf{A=ab} and \textbf{B=cde}. We have \textbf{A}×\textbf{B} = (\textbf{ab})×(\textbf{cde}) = (\textbf{a}×\textbf{cde}) + (\textbf{b}×\textbf{cde}) = \textbf{acde} + \textbf{bcde} = \textbf{acdebcde}. It's really simple!!! While multiplying we add second sting to each letter from the first sting. This "multiplication" is different from the regular one: order of multipliers is important. And to calculate the factorial as a multiplication of sequential strings: \textbf{a·b·c·}...\textbf{·z·aa·ab·}...\textbf{·az·ba·}...\textbf{·zz·aaa·}... we need ... just check yourself how long the result is. \InputFile The only line at the input contains integer \textbf{n} (\textbf{1} ≤ \textbf{n} ≤ \textbf{10000}) -- number of multipliers in the stringorial. \OutputFile You need to output the length of the resulting string.
Time limit 1 second
Memory limit 64 MiB
Input example #1
3
Output example #1
4
Source ACM-ICPC Ukraine 2012, 1st Stage Ukraine, April 21, 2012