#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int N=3e2+10;
int work(int n, int m, int i, int j) {//n行m列的螺旋矩阵,i行j列的序号
if (i == 1)
return j;
if (j == m)
return m + i - 1;
if (i == n)
return 2 * m + n - 2 - j + 1;
if (j == 1)
return 2 * (m+n) - 4 - i + 2;
// 注意,递归的时候,n 要减 2 而不是减 1
return work(n - 2, m - 2, i - 1, j - 1) + 2*(n+m) - 4;
}
int main() {
ll n,m;
//scanf("%lld%lld",&n,&m);
printf("%d\n",work(5,3,4,3));
return 0;
}