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 k;
  cin >> k;
  vector<int> v;
  int x = k;
  for (int i = 1; i <= x; i++) {
    if (v.size() >= x) {
      break;
    }
    if (i < 10) {
      v.push_back(i);
    }
    if ((i >= 10) && (i < 100)) {
      v.push_back(i / 10);
      v.push_back((i % 10));
    }
    if ((i >= 100) && (i < 1000)) {
      v.push_back(i / 100);
      v.push_back((i % 100) / 10);
      v.push_back((i % 100) % 10);
    }
    if ((i >= 1000)) {
      v.push_back(i / 1000);
      v.push_back((i % 1000) / 100);
      v.push_back(((i % 1000) % 100) / 10);
      v.push_back(((i % 1000) % 100) % 10);
    }
  }
  cout << v[x - 1] << endl;
}
