SP9952 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.

Each line contains an integer represents **n**(1 ≤ **n** ≤ 10 $ ^{18} $ ). Input is terminated by EOF, and contains at most 100 lines.

For each **n**, print an integer represents the answer.