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;
const int MOD = 1e9 + 7;
long long k;
long long dig[20];
int main(void) {
  scanf("%lld", &k);
  int dig = 1;
  long long curr = 9;
  while (k > (long long)dig * curr) {
    k -= (long long)dig * curr;
    ++dig;
    curr *= 10LL;
  }
  long long x = k / dig + (curr / 9);
  if (k % dig == 0) {
    printf("%d\n", (x - 1) % 10);
  } else {
    int n = dig - (k % dig);
    for (int i = 0; i < n; ++i) x /= 10LL;
    printf("%d\n", x % 10);
  }
  return 0;
}
