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 digit_count(int n) {
  int cnt = 0;
  while (n) cnt++, n /= 10;
  return cnt;
}
int find_ans(int k, int n) {
  int cnt = 0;
  while (cnt != k) n /= 10, cnt++;
  return n % 10;
}
int main() {
  int k;
  scanf("%d", &k);
  int cnt = 0;
  for (int i = 0; i <= k; i++) {
    cnt += digit_count(i);
    if (cnt == k and cnt < 9) {
      printf("%d\n", k);
      break;
    }
    if (cnt >= k) {
      int num = cnt - k;
      int ans = find_ans(num, i);
      printf("%d\n", ans);
      break;
    }
  }
  return 0;
}
