GUANGGUN  111…1 Squared
We call an integer Sticks if its decimal representation contains only digit 1.
Let S(n) be the sticks with n digits, find the sum of digits of S(n)^{2}
For example, S(9)^{2}=12345678987654321, its sum of digits is 81.
Input
Each line contains an integer represents n(1 ≤ n ≤ 10^{18}).
Input is terminated by EOF, and contains at most 100 lines.
Output
For each n, print an integer represents the answer.
Example
Input: 9 10 Output: 81 82
hide comments
tushargiri007:
20190118 13:20:15
see pattern .liitle help from spoojtoolkit


sanyam19:
20180619 11:24:09
just 4 line of code... :) just try to observe d pattern .. 

n_o_o_b_i_e:
20180617 12:44:36
take care of that eof condition 

sinersnvrsleep:
20180422 15:09:42
hats off to problem setter nice pattern 

sandeep_4141:
20170609 18:25:53
10 to 11 line code in c++ 

kass_97:
20170106 13:00:01
Not much to do in this problem, just observe the pattern 

aditya_rev:
20161115 06:36:00
only 2 lines logic code:) 

Amey Telawane:
20130810 20:35:34
take pen and paper to get it accepted 
Added by:  Bin Jin 
Date:  20111111 
Time limit:  0.200s 
Source limit:  4096B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 