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() {
  char ones, tens, hun, tho, str[101000];
  long long i = 0, k;
  cin >> k;
  for (tho = '0'; tho <= '3'; tho++) {
    for (hun = '0'; hun <= '9'; hun++) {
      for (tens = '0'; tens <= '9'; tens++) {
        for (ones = '0'; ones <= '9'; ones++) {
          if (i > 2889) str[i++] = tho;
          if (i > 189) str[i++] = hun;
          if (i > 9) str[i++] = tens;
          str[i++] = ones;
        }
      }
    }
  }
  cout << str[k];
  return 0;
}
