10
4 108 114
5 30 155
8 193 197
9 71 169
2 163 166
8 120 144
8 22 151
4 21 166
2 46 127
8 38 51
 20
9 142 172
7 132 256
8 245 315
9 496 496
3 345 362
8 13 162
5 342 470
9 16 488
9 467 482
4 471 478
10 92 224
6 228 261
9 54 167
2 402 409
5 9 10
7 225 360
3 438 483
6 252 342
3 491 493
6 296 367
 1
8 1234567890123 123456789012345

0
3
0
1
3
0
5
16
9
1
 0
0
0
0
4
6
13
7
0
0
1
2
3
0
0
2
12
9
1
4
 774752389568

#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T qmin(const T &a, const T &b) {
  return a < b ? a : b;
}
template <typename T>
inline T qmax(const T &a, const T &b) {
  return a > b ? a : b;
}
template <typename T>
inline void getmin(T &a, const T &b) {
  if (a > b) a = b;
}
template <typename T>
inline void getmax(T &a, const T &b) {
  if (a < b) a = b;
}
inline void fileio(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}
const int inf = (int)1e9 + 7;
const long long linf = (long long)1e17 + 7;
long long f[12][66][12];
inline void init() {
  for (register int i = (2); i <= (10); ++i) {
    f[i][0][0] = 1;
    for (register int j = (1); j <= (64); ++j) {
      for (register int k = (0); k <= (i); ++k) {
        f[i][j][k] =
            f[i][j - 1][k + 1] * (i - k) + (k ? f[i][j - 1][k - 1] : 0) * k;
      }
    }
  }
}
inline long long calc(long long x, int k) {
  if (!x) return 0;
  int p[66], odd[10], sz = 0, cnt = 0, tmp = x;
  while (x) {
    p[++sz] = x % k;
    x /= k;
  }
  memset(odd, 0, sizeof(odd));
  long long ans = 0;
  for (int i = 2; i < sz; i += 2) ans += f[k][i - 1][1] * (k - 1);
  for (register int i = (sz); i >= (1); --i) {
    if (i == sz) {
      for (register int v = (1); v <= (p[i] - 1); ++v) {
        odd[v] ^= 1;
        if (odd[v])
          ++cnt;
        else
          --cnt;
        ans += f[k][i - 1][cnt];
        odd[v] ^= 1;
        if (odd[v])
          ++cnt;
        else
          --cnt;
      }
    } else {
      for (register int v = (0); v <= (p[i] - 1); ++v) {
        odd[v] ^= 1;
        if (odd[v])
          ++cnt;
        else
          --cnt;
        ans += f[k][i - 1][cnt];
        odd[v] ^= 1;
        if (odd[v])
          ++cnt;
        else
          --cnt;
      }
    }
    odd[p[i]] ^= 1;
    if (odd[p[i]])
      ++cnt;
    else
      --cnt;
  }
  ans += (!cnt ? 1 : 0);
  return ans;
}
int main() {
  init();
  puts("endinit");
  return 0;
  int q;
  scanf("%d", &q);
  while (q--) {
    int k;
    long long l, r;
    scanf("%d%lld%lld", &k, &l, &r);
    printf("%lld\n", calc(r, k) - calc(l - 1, k));
  }
  return 0;
}
