Codeforces Round #352 (Div. 2) A

A. Summer Camp

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Every year, hundreds of people come to summer camps, they learn new algorithms and solve hard problems.

This is your first year at summer camp, and you are asked to solve the following problem. All integers starting with 1 are written in one line. The prefix of these line is "123456789101112131415...". Your task is to print the n-th digit of this string (digits are numbered starting with 1.

Input

The only line of the input contains a single integer n (1 ≤ n ≤ 1000) — the position of the digit you need to print.

Output

Print the n-th digit of the line.

Examples

Input

3

Output

3

Input

11

Output

0

Note

In the first sample the digit at position 3 is '3', as both integers 1 and 2 consist on one digit.

In the second sample, the digit at position 11 is '0', it belongs to the integer 10.

题意："1 2 3 4 5 6 7 8 9 10 11 12 13 14 15...". 连续的数 组成一个字符串（无空格 ，只是便于理解） 请输出n位置上的字符

题解： 可以直接暴力！！！ 比赛的时候想多了  分析出  1~99 共189位 最多为一个三位数 分段分析 注意细节

 #include<bits/stdc++.h>
 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<map>
 #include<queue>
 #include<stack>
 #define ll __int64
 #define pi acos(-1.0)
 using namespace std;
 int n;
 int main()
 {
     scanf("%d",&n);
     if(n<=)
     {
     cout<<n<<endl;
     return  ;
     }
     if(n>&&n<=)
     {
         n=n-;
         int exm=n/;
          n--;
          n=n%;
         if(n==)
         cout<<(exm+)%<<endl;
         else
         cout<<(exm+)/<<endl;
         return ;
     }
     if(n>)
     {
         n=n-;
         int exm=n/;
         n=n-;
         n=n%;
         if(n==)
         cout<<(exm+)%<<endl;
         if(n==)
         cout<<(exm+)/<<endl;
         if(n==)
         cout<<(exm+-(exm+)/*)/<<endl;
         return ;
     }
     return ;
 }