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
#include <bits/stdc++.h>
using namespace std;
const long long n[13] = {
    1ll,
    10ll,
    190ll,
    2890ll,
    38890ll,
    488890ll,
    5888890ll,
    68888890ll,
    788888890ll,
    8888888890ll,
    98888888890ll,
    1088888888890ll,
    11888888888890ll,
};
long long t[12] = {
    1ll,         10ll,         100ll,         1000ll,
    10000ll,     100000ll,     1000000ll,     10000000ll,
    100000000ll, 1000000000ll, 10000000000ll, 100000000000ll,
};
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long k;
  cin >> k;
  int d = upper_bound(n, n + 13, k) - n - 1;
  k -= n[d];
  cout << (t[d] + k / (d + 1)) / t[d - k % (d + 1)] % 10;
}
