#include <bits/stdc++.h>
using namespace std;
ifstream in("input.txt");
ofstream out("output.txt");
const long long mod = 1e9 + 7;
int n, m, timer = 0;
vector<vector<int> > Gr;
int bin(vector<int> &a, int k) {
  int L = 0, R = a.size() - 1;
  while (L < R) {
    int m = (L + R) / 2;
    if (a[m] < k)
      L = m + 1;
    else
      R = m;
  }
  if (a[(L + R) / 2] < k) return -1;
  return a[(L + R) / 2];
}
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res *= a;
    a *= a;
    b >>= 1;
  }
  return res;
}
int main() {
  ios::sync_with_stdio(0);
  long long w, h, ans = 0;
  cin >> w >> h;
  for (int i = 0; i <= w; i++) {
    long long z = i / 2;
    for (int j = 0; j <= h; j++) {
      long long p = j / 2;
      ans += z * p;
    }
  }
  cout << ans;
  return 0;
}
