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 cnt = 0, mini = 1e9, maxi = -1;
int mini1 = 1e9, maxi1 = -1, cnt1 = 0, cnt2 = 0;
int n;
string str;
void lol(int x) {
  string rev = "";
  while (x > 0) {
    int res = x % 10;
    x /= 10;
    rev += res + '0';
  }
  reverse(rev.begin(), rev.end());
  str += rev;
}
int main() {
  cin >> n;
  for (int i = 1; i < 10001; i++) {
    lol(i);
  }
  cout << str[n - 1];
}
