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 const INF = 1234;
const int N = 100003;
int simple(int n) {
  int i, sq;
  if (n % 2 == 0) {
    return 0;
  }
  sq = (int)sqrt(n);
  for (i = 3; i <= sq; i++) {
    if ((n % i) == 0) {
      return 0;
    }
  }
  return 1;
}
long long gcd(long long a, long long b) {
  if (a > b) swap(a, b);
  if (!a) return b;
  return gcd(b % a, a);
}
void solve() {
  int k;
  cin >> k;
  string s = "";
  for (int i = 1; i <= 10000; ++i) {
    string tmp = "";
    int num = i;
    while (num != 0) {
      int r = num % 10;
      tmp += r + '0';
      num /= 10;
    }
    reverse(tmp.begin(), tmp.end());
    s += tmp;
  }
  cout << s[k - 1] << endl;
}
int main() {
  int T = 1;
  while (T--) {
    solve();
  }
}
