#include <bits/stdc++.h>
#pragma gcc optimize("O3")
const int nmax = 0;
const int mod = 1e9 + 7;
const long long inf = 0x3f3f3f3f3f3f3f3f;
const long double pi = 3.1415926535897932384626433832795;
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  string s = "";
  int n;
  cin >> n;
  for (int i = 1; i <= 10000; i++) s += to_string(i);
  cout << s[n - 1];
}

### Prompt

Please formulate a Cpp solution to 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>
#pragma gcc optimize("O3")
const int nmax = 0;
const int mod = 1e9 + 7;
const long long inf = 0x3f3f3f3f3f3f3f3f;
const long double pi = 3.1415926535897932384626433832795;
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  string s = "";
  int n;
  cin >> n;
  for (int i = 1; i <= 10000; i++) s += to_string(i);
  cout << s[n - 1];
}

```