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 g(long long n, long long i) {
  if (i == 0) {
    return n % 10;
  }
  return g(n / 10, i - 1);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long k;
  cin >> k;
  long long i = 1, j = 9;
  long long s = 9, p = 0;
  while (s <= k) {
    i++;
    j = j * 10;
    p = s;
    s = s + (i * j);
  }
  long long f = (k - p) / i;
  f = f + (pow(10, i - 1)) - 1;
  if ((k - p) % i == 0) {
    cout << g(f, 0);
  } else {
    f++;
    cout << g(f, i - ((k - p) % i));
  }
  return 0;
}
