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.io.FileNotFoundException;
import java.util.Scanner;

public class P1177A {

    public static void main(String[] args) throws FileNotFoundException {

        Scanner in = new Scanner(System.in);
        // Scanner in = new Scanner(new File("input.txt"));
        System.out.println(solve(in.nextInt()));

    }

    private static String solve(int k) {

        int digitCnt = 1;
        int nine = 9;

        while (k > nine * digitCnt) {
            k -= nine * digitCnt;
            nine *= 10;
            digitCnt++;
        }

        int num = nine / 9 - 1 + (k - 1) / digitCnt + 1;
        return String.valueOf(String.valueOf(num).charAt((k - 1) % digitCnt));

    }

}
