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, a = 1, tmp = 0, rem, ans, flag = 1;
  cin >> k;
  while (1) {
    tmp++;
    if ((k - 9 * a * flag) <= 0) break;
    k = k - 9 * a * flag;
    a = a * 10;
    flag++;
  }
  rem = ((k % tmp == 0) ? tmp : k % tmp);
  k = ceil(k * 1.0 / tmp);
  k = k + pow(10, tmp - 1) - 1;
  string s = '0' + to_string(k);
  ans = s[rem] - 48;
  cout << ans << endl;
}
int main() {
  int t = 1;
  while (t--) solve();
  return 0;
}
