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>
#pragma GCC optimize("Ofast")
using namespace std;
signed main() {
  std::ios_base::sync_with_stdio(0), cin.tie(0);
  long long k;
  cin >> k;
  long long len = 1;
  long long cur = 9;
  for (int i = 1; i <= 30; ++i) {
    if (cur * i < k) {
      k -= cur * i;
      cur *= 10;
    } else {
      len = i;
      break;
    }
  }
  long long x = ((k + len - 1) / len);
  k %= len;
  if (!k) k += len;
  for (int i = 1; i <= len; ++i) {
    long long num;
    if (i == 1)
      num = 1;
    else
      num = 0;
    for (int j = 0; j < 10; ++j) {
      if (i == 1 && j == 0) continue;
      if (pow(10, len - i) < x) {
        x -= pow(10, len - i);
        num = j + 1;
      }
    }
    if (i == k) {
      cout << num;
      return 0;
    }
  }
  return 0;
}
