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;
int main() {
  long long int n, l = 1, r = 9, s = 1, c = 0;
  cin >> n;
  while (1) {
    if (c + (r - l + 1) * s >= n) break;
    c += (r - l + 1) * s;
    s++;
    l *= 10;
    r = r * 10 + 9;
  }
  l += (n - c) / s;
  c += (n - c) / s * s;
  if (n == c) {
    string a = to_string(l - 1);
    cout << a.back() << endl;
  } else {
    string a = to_string(l);
    cout << a[n - c - 1] << endl;
  }
}
