#include <bits/stdc++.h>
using namespace std;
long long a[21][21], dp[21][21];
int main() {
int a1, a2, b1, b2;
cin >> a1 >> a2 >> b1 >> b2;
a1++;
a2++;
b1++;
b2++;
int x[9] = {-2, -1, 1, 2, 2, 1, -1, -2, 0};
int y[9] = {-1, -2, -2, -1, 1, 2, 2, 1, 0};
memset(a, 0, sizeof(a));
for (int i = 0; i < 9; i++) {
int dx = b1 + x[i];
int dy = b2 + y[i];
if (dx >= 0 && dx < 21 && dy >= 0 && dy < 21) {
a[dx][dy] = 1;
}
}
memset(dp, 0, sizeof(dp));
if (a[1][1] == 0) dp[1][1] = 1;
for (int i = 1; i <= a1; i++) {
for (int j = 1; j <= a2; j++) {
if (a[i][j] == 1) {
dp[i][j] = 0;
} else {
if (i > 1) dp[i][j] += dp[i - 1][j];
if (j > 1) dp[i][j] += dp[i][j - 1];
}
}
}
long long ans = dp[a1][a2];
cout << ans;
return 0;
}
靠