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;
long long k;
int solve(long long k) {
  long long cnt = 9, st = 1;
  for (int len = 1;; ++len) {
    if (cnt * len >= k) {
      --k;
      long long num = st + k / len;
      stringstream s;
      s << num;
      return s.str()[k % len] - '0';
    } else {
      k -= cnt * len;
    }
    st *= 10;
    cnt *= 10;
  }
}
int main() {
  cin >> k;
  cout << solve(k) << endl;
  return 0;
}
