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>
void answer(char v) { std::cout << v << '\n'; }
void solve(unsigned k) {
  unsigned b = 1, c = 1;
  while (k >= c * b * 9) {
    k -= c * b * 9;
    ++c;
    b *= 10;
  }
  const unsigned x = b + (k % c == 0 ? k / c - 1 : k / c);
  const unsigned i = k % c;
  const std::string s = std::to_string(x);
  if (i == 0)
    answer(s.back());
  else
    answer(s[i - 1]);
}
int main() {
  unsigned k;
  std::cin >> k;
  solve(k);
  return 0;
}
