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 math

def get_digit(x, pos):
    s = []
    
    while x > 0:
        s.append(x%10)
        x //= 10
        
    return s[::-1][pos]    

def find_digit(x):
    n     = 0
    next_ = 9 * (10**n) * (n+1)
    
    while next_ <= x:
        x -= next_
   
        n += 1
        next_ = 9 * (10**n) * (n+1)
    
    if x == 0:
        return 9
    
    pos_ = 10 ** n + math.ceil(x / (n+1)) - 1
    
    return get_digit(pos_, (x-1)%(n+1))

# 123456789101112131415
k = int(input())
print(find_digit(k))