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 qpow(long long n, long long k) {
  long long ret = 1;
  for (; k; k >>= 1, n = n * n)
    if (k & 1) ret *= n;
  return ret;
}
long long K;
int main() {
  cin >> K;
  long long sum = 0, q = 1, p, re, f;
  while (sum + q * 9 * qpow(10, q - 1) < K) {
    sum += q * 9 * qpow(10, q - 1);
    q++;
  }
  p = qpow(10, q - 1) + (K - sum) / q;
  re = (K - sum) % q;
  if (re == 0) return cout << (p - 1) % 10 << endl, 0;
  f = q - re;
  for (; f > 0; --f) p /= 10;
  cout << p % 10 << endl;
  return 0;
}
