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() {
  long long n;
  cin >> n;
  if (n <= 9) {
    cout << n;
    return 0;
  } else {
    if (n <= 189) {
      int num = 10 + (n - 10) / 2;
      if (n % 2 == 0) {
        cout << (num / 10);
        return 0;
      } else
        cout << (num % 10);
      return 0;
    } else if (n <= 2889) {
      long long num = 100 + (n - 190) / 3;
      if (n % 3 == 0) {
        cout << (num % 10);
      } else if (n % 3 == 1) {
        cout << num / 100;
      } else {
        cout << ((num / 10) % 10);
      }
      return 0;
    } else {
      long long num = 1000 + (n - 2890) / 4;
      if (n % 4 == 1) {
        cout << (num % 10);
      } else if (n % 4 == 2) {
        cout << (num / 1000);
      } else if (n % 4 == 3)
        cout << ((num / 100) % 10);
      else
        cout << ((num / 10) % 10);
      return 0;
    }
  }
}
