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;
vector<long long int> v;
void solve(long long int a) {
  long long int a2 = a;
  long long int co = floor(log10(a) + 1);
  while (co) {
    a2 /= pow(10, co - 1);
    v.push_back(a2 % 10);
    co--;
    a2 = a;
  }
}
int main() {
  long long int n;
  cin >> n;
  v.push_back(0);
  for (long long int i = 1; i <= 1200000; i++) {
    solve(i);
  }
  cout << v[n];
}
