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 mod = 1e9 + 7;
string char_to_str(char c) {
  string tem(1, c);
  return tem;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long k;
  cin >> k;
  long long temp = k;
  long long i = 1;
  if (k <= 9) {
    cout << k;
    return 0;
  }
  while ((temp - (9 * pow(10, i - 1) * i)) > 0) {
    temp = temp - (9 * pow(10, i - 1) * i);
    i++;
  }
  temp--;
  long long q = temp / i;
  long long r = temp % i;
  long long ten = 1;
  long long j = i;
  j--;
  while (j--) {
    ten = ten * 10;
  }
  long long num = ten + (q);
  long long digit = r + 1;
  long long from_right = i - digit + 1;
  long long ans = 0;
  while (from_right--) {
    ans = (num % 10);
    num = (num / 10);
  }
  cout << ans;
  return 0;
}
