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 B1177 {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        long N = in.nextLong();
        long answer = solve(N, 0, 1, 1);
        System.out.println(answer);
    }

    static long solve(long N, long offset, long start, int digits) {
        long thisSection = digits*start*9;
        long fromOffset = N-offset;
        if (fromOffset > thisSection) {
            return solve(N, offset+thisSection, 10*start, digits+1);
        }
        long number = start + (fromOffset-1)/digits;
        long posInNumber = digits - 1 - (fromOffset-1)%digits;
        while (posInNumber > 0) {
            posInNumber--;
            number /= 10;
        }
        return number%10;
    }

}
