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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class A {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        long K = Long.valueOf(br.readLine());
        long n = 0;
        long k = 0; //len * Math.pow(10, len) * 0.9;
        long len = 0;
        while(true){
            len++;
            long preK = k;
            long preN = n;
            k += len * Math.pow(10, len) * 0.9;
            n += Math.pow(10, len) * 0.9;
            if(K < k) {
                k = preK;
                n = preN;
                break;
            }
        }
        long step = len - 1;
        while(true){
            while(k <= K){
                long preK = k;
                long preN = n;
                if(step == 0){
                    k += len;
                    n++;
                }else{
                    k += len * Math.pow(10, step) * 0.9;
                    n += Math.pow(10, step) * 0.9;
                }
                if(k == K || (k >= K && k - K < len)){
                    //System.out.println(k);
                    //System.out.println(n);
                    String nStr = Long.toString(n);
                    System.out.println(nStr.charAt(nStr.length() - (int)(k-K) - 1));
                    return;
                }
                if(K < k){
                    k = preK;
                    n = preN;
                    break;
                }
            }
            step--;
        }
    }
}
