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;
int main() {
  long long a[20] = {0, 9}, b[20] = {1, 10};
  long long n, k, m;
  long long i;
  for (i = 2; i < 13; i++) {
    b[i] = b[i - 1] * 10;
    a[i] = 9 * b[i - 1] * i + a[i - 1];
  }
  cin >> k;
  for (i = 0; i < 13; i++) {
    if (k <= a[i]) {
      k -= a[i - 1] + 1;
      n = i;
      break;
    }
  }
  m = k / n + b[n - 1];
  k = n - k % n;
  n = m / b[k - 1] % 10;
  cout << n;
  return 0;
}
