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 int start_up() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  return 0;
}
long long int static r = start_up();
void solve() {
  long long int k;
  cin >> k;
  string s;
  long long int c = 1;
  for (long long int i = 1;; i++) {
    if (c < 10)
      s += char(48 + c);
    else {
      ostringstream s1;
      s1 << c;
      string add = s1.str();
      s += add;
    }
    ++c;
    if (s.length() >= k) {
      cout << s[k - 1] << " ";
      break;
    }
  }
}
signed main() {
  solve();
  return 0;
}
