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;
unsigned long long k, ac = 0, m = 9, i, pw;
bool f(unsigned long long x) { return (x - pw) * i < k; }
int main() {
  cin >> k;
  for (i = 1; ac < k; i++) {
    ac += i * m;
    m *= 10;
  }
  i--;
  m /= 10;
  ac -= i * m;
  k -= ac;
  pw = pow(10, i - 1);
  unsigned long long l = pw, r = pw * 10;
  while (l + 1 < r) {
    unsigned long long mid = (l + r) / 2;
    if (f(mid))
      l = mid;
    else
      r = mid;
  }
  k = k - (l - pw) * i;
  int index = i - k + 1;
  for (int j = 1; j < index; j++) l /= 10;
  cout << l % 10;
}
