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 pow(long long di, long long c) {
  long long ans = 1;
  while (c--) ans *= di;
  return ans;
}
long long dig[3000000];
int main() {
  for (int i = 1; i < 16; i++) {
    dig[i] = i * 9 * (long long)pow(10, i - 1) + dig[i - 1];
  }
  long long k;
  cin >> k;
  for (int i = 0; i < 16; i++) {
    if (k > dig[i] && k <= dig[i + 1]) {
      int ws = i + 1;
      k -= dig[i];
      long long t2 = k % ws == 0 ? ws : k % ws;
      long long t1 = (k - 1) / ws + 1;
      long long start = pow(10, ws - 1);
      start += t1 - 1;
      printf("%lld\n", start / (long long)pow(10, ws - t2) % 10);
      break;
    }
  }
  return 0;
}
