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;
string toString(long long n) {
  string str = "";
  while (n) {
    str += n % 10 + '0';
    n /= 10;
  }
  reverse(str.begin(), str.end());
  return str;
}
int main() {
  string s = "";
  for (auto i = (1); i <= (10000); ++i) {
    string t = toString(i);
    s += t;
  }
  long long n;
  scanf("%lld", &n);
  if (n <= (int)s.size())
    printf("%c\n", s[n - 1]);
  else {
    n -= 9;
    long long cur = 180LL;
    int digit = 2;
    long long power = 10;
    while (n > cur) {
      n -= cur;
      power *= 10LL;
      ++digit;
      cur = 9LL * digit * power;
    }
    power += n / digit - 1;
    n %= digit;
    if (n) ++power;
    string str = toString(power);
    if (n == 0)
      cout << str[(int)str.size() - 1] << endl;
    else
      cout << str[n - 1] << endl;
  }
  return 0;
}
