#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, 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 = 1e8 + 10;
bitset<N> vis;
int n, a, b, c, d;
unsigned calc(int n, int p) {
  unsigned ans = 0, w = a * p * p * p + b * p * p + c * p + d;
  while (n /= p) ans += n * w;
  return ans;
}
int ck(int first) {
  if (first % 2 == 0 || first % 3 == 0 || first % 5 == 0 || first % 7 == 0)
    return 0;
  return 1;
}
int main() {
  scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
  unsigned ans = calc(n, 2) + calc(n, 3) + calc(n, 5) + calc(n, 7);
  for (int i = 11; i * i <= n; i += 2)
    if (ck(i) && !vis[i / 3]) {
      for (int j = i * i; j <= n; j += i)
        if (ck(j)) vis[j / 3] = 1;
    }
  for (int i = 11; i <= n; i += 2)
    if (ck(i) && !vis[i / 3]) ans += calc(n, i);
  printf("%u\n", ans);
}
