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 BDigitSequence {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        long k = scan.nextLong();

        long digits = 1;
        long counter = 9L;

        while(k > counter * digits) {
            k -= counter * digits;
            counter *= 10;
            digits++;
        }

        long num = (long)(Math.ceil((double)k/digits));
        String s = String.valueOf((long)Math.pow(10,digits-1) - 1 + num );

        System.out.println(s.charAt((int)((k+digits-1)%digits)));
    }
}
