Let's write all the positive integer numbers one after another from 1 without any delimiters (i.e. as a single string). It will be the infinite sequence starting with 123456789101112131415161718192021222324252627282930313233343536...

Your task is to print the k-th digit of this sequence.

Input

The first and only line contains integer k (1 ≤ k ≤ 10000) — the position to process (1-based index).

Output

Print the k-th digit of the resulting infinite sequence.

Examples

Input


7


Output


7


Input


21


Output


5
import java.util.Scanner;

public class Problem1177A {

	private static Scanner in;

	public static void main(String[] args) {
		in = new Scanner(System.in);
		int k = in.nextInt();
		int digitsProcessed = 0;
		for (int i = 1; ; i++) {
			int numDigits = findNumberOfDigits(i);
			if(digitsProcessed + numDigits >=  k) {
				System.out.println(findIthDigit(i,k - digitsProcessed));
				break;
			}
			digitsProcessed += numDigits;
		}
	}
	
	private static int findNumberOfDigits(int k) {
		int numDigits = 0;
		while(k > 0) {
			numDigits ++;
			k /= 10;
		}
		return numDigits;
	}
	
	private static int findIthDigit(int k, int i) {
		int numDigits = findNumberOfDigits(k);
		int divisor = ((Double)Math.pow(10, numDigits + 1 - i)).intValue();
		k = k % divisor;
		divisor /= 10;
		k = k/divisor;
		return k;
	}
}
