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 1are 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.

解题说明：此题n范围较小，可以暴力来做，先生成一个长度为1000的序列，然后直接输出对应位即可。

#include<cstdio>
#include <cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include <map>
using namespace std;

int main()
{
	 char s[5000],s1[5000];
	 int i,n;
	 for(i=1;i<=1000;i++)
	 {
	   sprintf(s1,"%d",i);
	   strcat(s,s1);
	 }
	 scanf("%d",&n);
	 printf("%c\n",s[n-1]);
	 return 0;
}