codeforces552B Vanya and Books

B. Vanya and Books

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vanya got an important task — he should enumerate books in the library and label each book with its number. Each of the n books should be assigned with a number from 1 to n. Naturally, distinct books should be assigned distinct numbers.

Vanya wants to know how many digits he will have to write down as he labels the books.

Input

The first line contains integer n (1 ≤ n ≤ 10⁹) — the number of books in the library.

Output

Print the number of digits needed to number all the books.

Examples

Input

13

Output

17

Input

4

Output

4

Note

Note to the first test. The books get numbers 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, which totals to 17 digits.

Note to the second sample. The books get numbers 1, 2, 3, 4, which totals to 4 digits.

脑子秀逗了，竟然暴力起来了，超时了2次。。。。。

思路：设所给n的长度为N，先确定长度为N-1的所有数据位数和；所得剩下的数的位数都为N，易得长度为N的数的所有位数和为（n-10^(N-1)+1)*N,两者相加即为答案。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
typedef long long ll;
using namespace std;
ll pow(int x,int y){
    ll sum=1;
    while(y){
        if(y&1) sum=sum*x;
        x=x*x;
        y>>=1;
    }
    return sum;
}
int main(){
    int n;
    while(cin>>n){
        ll ans=0;
        int len=int(log10(n));
        for(int i=1;i<=len;i++) ans+=(9*pow(10,i-1)*i);
        ans=ans+(n-pow(10,len)+1)*(len+1);
        cout<<ans<<endl;
    }
    return 0;
}