#include <bits/stdc++.h>
using namespace std;
const long long int inf = INT_MAX;
const long long int mod = 1000000007;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a / gcd(a, b)) * b;
}
int factorial(long long int n) {
  return (n == 1 || n == 0) ? 1 : n * factorial(n - 1);
}
long long int sm(long long int n) {
  long long int ans = n * (n + 1) / 2;
  return ans;
}
bool isprime(long long int x) {
  for (long long int i = 2; i * i <= x; i++) {
    if (x % i == 0) return 0;
  }
  return 1;
}
bool perfectSquare(long double x) {
  long double sr = sqrt(x);
  return ((sr - floor(sr)) == 0);
}
void solve() {
  int64_t w, h, i;
  cin >> w >> h;
  int64_t ans1 = 0, ans2 = 0;
  for (i = 2; i <= w; i += 2) ans1 += (w - i + 1);
  for (i = 2; i <= h; i += 2) ans2 += (h - i + 1);
  cout << ans1 * ans2 << "\n";
  ;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long int test_case = 1;
  while (test_case--) {
    solve();
  }
  return 0;
}
