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
def count(start, k):
    #print('in count:', start, k)
    s = "_"
    while len(s) <= k:
        s += str(start)
        start += 1
    #print(s)
    return s[k]

def recursion(n, k):
    #print(n, k, 9*(10**(n-1))*n)
    if k > 9*(10**(n-1))*n:
        recursion(n+1, k - 9*(10**(n-1))*n)
    else:
        print(count(10**(n-1), k))            
    
k = int(input())

if k < 10:
    print(k)
else:
    recursion(1, k)