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 main() {
  int arr[10001];
  int i = 1;
  int j = 1;
  while (i < 10001) {
    if (j < 10) {
      arr[i] = j;
      i++;
    }
    if (j >= 10 && j < 100) {
      arr[i] = j / 10;
      arr[i + 1] = j % 10;
      i += 2;
    }
    if (j >= 100 && j < 1000) {
      arr[i] = j / 100;
      arr[i + 1] = j / 10 - arr[i] * 10;
      arr[i + 2] = j % 10;
      i += 3;
    }
    if (j >= 1000) {
      arr[i] = j / 1000;
      arr[i + 1] = j / 100 - arr[i] * 10;
      arr[i + 2] = j / 10 - arr[i + 1] * 10 - arr[i] * 100;
      arr[i + 3] = j % 10;
      i += 4;
    }
    j++;
  }
  int k;
  cin >> k;
  cout << arr[k];
  return 0;
}
