#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, P2 = 998244353, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 1e6 + 10;
int n, m, k, a[N];
char s[N];
int main() {
  long long k;
  scanf("%lld", &k);
  long long first = 9, now = 0;
  for (int i = 1;; ++i, first *= 10) {
    if (k <= i * first) {
      long long rk = (k - 1) / i;
      k -= rk * i;
      long long num = now + rk + 1;
      for (int j = 1; j <= i - k; ++j) num /= 10;
      printf("%lld\n", num % 10);
      return 0;
    } else
      k -= i * first, now += first;
  }
}
