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
# -*-coding:utf-8-*-
def solution():
    k = int(input())
    k -= 1 # 字符串起始从0
    n, m = 1, 9
    while k > n*m:
        k, n, m = k - n*m, n+1, m*10
        # n记录属于哪一个区段，m记录这个区段内小段数
        # 1位 1x1x9  2位  2x10x9  3位  3x100x9
    x = str(10**(n-1) + k//n)[k % n]
    # 10**(n-1) + k//n计算是哪一个整数
    print(x)


if __name__ == "__main__":
    solution()

