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

    }

    static void solution1(Long index){
        int i = 1;  // group number
        long len = 9;    // the max length
        long max = 9;    // the max integer
        while(len < index){
            long tmp = 9 * (long) Math.pow(10, i);
            i++;
            len += i * tmp;
            max += tmp;
        }
        long diff = len - index; // the digit number between index and len
        long laterCount = diff / i;  // the number after index
        int remainder = (int) (diff % i);
        long current = max - laterCount; // the number of the index
        int k = i - 1 - remainder;
        System.out.println(String.valueOf(current).charAt(k));
    }
}
