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 bisect

    
b = []
a = []
b.append(0)

for i in range(1, 15):
	b.append(9 * i * (10 ** (i - 1)))


a.append(b[0])
for i in range(1, 15):
	a.append(a[i - 1] + b[i])

k = int(input())

th = bisect.bisect_left(a, k)
th -= 1;
k = k - a[th];
start = 10 ** th;
now = th + 1;
rem = k % now;
iss = k / now;
end = start + (k / now);
temp = str(end - 1);
s = "";
s += temp[now - 1] + str(end) + str(end + 1);



print(s[0 + rem])

 