#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int in() {
  int x;
  cin >> x;
  return x;
}
long long lin() {
  unsigned long long x;
  cin >> x;
  return x;
}
string stin() {
  string s;
  cin >> s;
  return s;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
vector<int> iota(int n) {
  vector<int> a(n);
  iota(begin(a), end(a), 0);
  return a;
}
void print() { putchar(' '); }
void print(bool a) { cout << a; }
void print(int a) { cout << a; }
void print(long long a) { cout << a; }
void print(char a) { cout << a; }
void print(string& a) { cout << a; }
void print(double a) { cout << a; }
template <class T>
void print(const vector<T>&);
template <class T, size_t size>
void print(const array<T, size>&);
template <class T, class L>
void print(const pair<T, L>& p);
template <class T, size_t size>
void print(const T (&)[size]);
template <class T>
void print(const vector<T>& a) {
  if (a.empty()) return;
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    cout << " ";
    print(*i);
  }
  cout << endl;
}
template <class T>
void print(const deque<T>& a) {
  if (a.empty()) return;
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    cout << " ";
    print(*i);
  }
}
template <class T, size_t size>
void print(const array<T, size>& a) {
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    cout << " ";
    print(*i);
  }
}
template <class T, class L>
void print(const pair<T, L>& p) {
  cout << '(';
  print(p.first);
  cout << ",";
  print(p.second);
  cout << ')';
}
template <class T, size_t size>
void print(const T (&a)[size]) {
  print(a[0]);
  for (auto i = a; ++i != end(a);) {
    cout << " ";
    print(*i);
  }
}
template <class T>
void print(const T& a) {
  cout << a;
}
int out() {
  putchar('\n');
  return 0;
}
template <class T>
int out(const T& t) {
  print(t);
  putchar('\n');
  return 0;
}
template <class Head, class... Tail>
int out(const Head& head, const Tail&... tail) {
  print(head);
  putchar(' ');
  out(tail...);
  return 0;
}
long long gcd(long long a, long long b) {
  while (b) {
    long long c = b;
    b = a % b;
    a = c;
  }
  return a;
}
long long lcm(long long a, long long b) {
  if (!a || !b) return 0;
  return a * b / gcd(a, b);
}
vector<pair<long long, long long> > factor(long long x) {
  vector<pair<long long, long long> > ans;
  for (long long i = 2; i * i <= x; i++)
    if (x % i == 0) {
      ans.push_back({i, 1});
      while ((x /= i) % i == 0) ans.back().second++;
    }
  if (x != 1) ans.push_back({x, 1});
  return ans;
}
vector<int> divisor(int x) {
  vector<int> ans;
  for (int i = 1; i * i <= x; i++)
    if (x % i == 0) {
      ans.push_back(i);
      if (i * i != x) ans.push_back(x / i);
    }
  return ans;
}
int popcount(long long x) { return __builtin_popcountll(x); }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int n) { return uniform_int_distribution<int>(0, n)(rng); }
template <class... T>
void err(const T&...) {}
using ui = unsigned int;
signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cout << fixed << setprecision(15);
  ui n = in(), a = in(), b = in(), c = in(), d = in();
  constexpr int u[8] = {1, 7, 11, 13, 17, 19, 23, 29};
  constexpr int v[30] = {
      0, 1, 0,  0, 0,  0, 0, 2, 0,  0, 0, 4, 0, 8, 0,
      0, 0, 16, 0, 32, 0, 0, 0, 64, 0, 0, 0, 0, 0, 128,
  };
  auto f = [&](ui x) -> ui { return x * x * x * a + x * x * b + x * c + d; };
  int l = n / 30 + 1;
  vector<char> bb(l, 0);
  bb[0] = 1;
  for (int h = 0; h < 8; h++) {
    int i = (bb.size() - 1) * 30 + u[h];
    if (i > n) bb[i / 30] |= 1 << h;
  }
  int m = (int)sqrt(n) / 30 + 1;
  for (int k = 0; k < m; k++) {
    for (int h = 0; h < 8; h++) {
      if (bb[k] >> h & 1) continue;
      int i = k * 30 + u[h];
      for (int j = i * i; j <= n; j += i) {
        if (int t = v[j % 30]; t) bb[j / 30] |= t;
      }
    }
  }
  ui ans = 0;
  int r = 0;
  vector<int> p;
  for (int i = 2; i <= 5; i++) {
    if (i > n) break;
    if (i == 2 || i == 3 || i == 5) {
      ui cnt = 0;
      ui now = i;
      while (1) {
        ui nxt = n / now;
        cnt += nxt;
        if (nxt < i)
          break;
        else
          now *= i;
      }
      ans += f(i) * cnt;
      r++;
    }
  }
  for (int k = 0; k < l; k++) {
    for (int h = 0; h < 8; h++) {
      if (bb[k] >> h & 1) continue;
      int i = k * 30 + u[h];
      ui cnt = 0;
      ui now = i;
      while (1) {
        ui nxt = n / now;
        cnt += nxt;
        if (nxt < i)
          break;
        else
          now *= i;
      }
      ans += f(i) * cnt;
      r++;
    }
  }
  cout << ans << '\n';
  return 0;
}
