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;
void solve() {
  long long k;
  cin >> k;
  long long i = 0, prev = 0;
  while (k > prev + (9 * pow(10, i) * (i + 1))) {
    prev += 9 * pow(10, i) * (i + 1);
    i++;
  }
  k -= prev;
  long long temp;
  temp = pow(10, i) + (k / (i + 1)) - 1;
  if (k % (i + 1) != 0) {
    temp++;
  }
  if (k % (i + 1) == 0) {
    cout << temp % 10 << "\n";
  } else {
    long long ans = temp / pow(10, i + 1 - (k % (i + 1)));
    ans %= 10;
    cout << ans << "\n";
  }
}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
