#include <bits/stdc++.h>
using namespace std;
void firstAttempt() {
  int k;
  cin >> k;
  if (k <= 9) {
    cout << k;
    return;
  } else {
    if (k % 2 == 0)
      cout << (k - 10) / 20 + 1;
    else
      cout << ((k - 11) % 20) / 2;
  }
}
int main() {
  int k;
  cin >> k;
  string s = "";
  for (int i = 1; i <= k; i++) {
    s.append(to_string(i));
  }
  char algo = s[k - 1];
  cout << algo;
  return 0;
}

### Prompt

In Cpp, your task is to solve the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
void firstAttempt() {
  int k;
  cin >> k;
  if (k <= 9) {
    cout << k;
    return;
  } else {
    if (k % 2 == 0)
      cout << (k - 10) / 20 + 1;
    else
      cout << ((k - 11) % 20) / 2;
  }
}
int main() {
  int k;
  cin >> k;
  string s = "";
  for (int i = 1; i <= k; i++) {
    s.append(to_string(i));
  }
  char algo = s[k - 1];
  cout << algo;
  return 0;
}

```