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 solve(long long m) {
  long long n = m;
  long long start = 1, len = 1, count = 9;
  while (n > len * count) {
    n = n - len * count;
    len++;
    count = count * 10;
    start = start * 10;
  }
  start = start + (n - 1) / len;
  return to_string(start)[((int)((n - 1) % len))] - '0';
}
int main() {
  long long k;
  cin >> k;
  cout << solve(k) << endl;
  return 0;
}
