The task is simple: given any positive integer N, you are supposed to count the total number of 1's in the decimal form of the integers from 1 to N. For example, given N being 12, there are five 1's in 1, 10, 11, and 12.

Input Specification:

Each input file contains one test case which gives the positive N (<=2³⁰).

Output Specification:

For each test case, print the number of 1's in one line.

Sample Input:

12

Sample Output:

5

 #include<cstdio>

 #include<stack>

 #include<cstring>

 #include<iostream>

 #include<stack>

 #include<set>

 #include<map>

 using namespace std;

 //count的最大值是1036019223

 int main(){

     int n;

     scanf("%d",&n);

     long long base=;

     long long count=;

     int frpart,afpart,a;

     while(n>=base){

         a=n/base%;

         frpart=n/(*base);

         afpart=n%base;

         count+=frpart*base;

         if(a==){

             count+=afpart+;

         }

         else if(a>){

             count+=base;

         }

         base*=;

     }

     printf("%lld\n",count);

     return ;

 }