#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define gtr(T) vector<T>,greater<T>
#define ACPC ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

void err(istream_iterator<string> it) {cerr << endl;}
template<typename T, typename... Args>void err(istream_iterator<string> it, T a, Args... args) {cerr << *it << " = " << a << endl;err(++it, args...);}

using ll  = long long;
using pii = pair<int,int>;
using vi  = vector<int>;
using vvi = vector<vector<int>>;

template<typename T>
istream & operator >> (istream &in, vector<T> &a){
    for(auto &i: a)
        in >> i;
    return in;
}
template<typename T>
ostream & operator << (ostream &out, const vector<T> &a){
    for(auto &i: a)
        out << i << ' ';
    return out;
}

const int dx[] = {0, 0, 1,  -1, 1, -1,  1, -1};
const int dy[] = {1 , -1, 0, 0, 1, -1, -1,  1};


const int N   = 1e6 + 5;
const int M   = 1e3 + 5;
const ll  INF  = 1e18;
const int MOD = 1e9 + 7;
const int LOG = 19;

void doShit() {
    int n ,h ,w ;
    cin >> n >> h >> w;
    int x = max(h, n - h);
    int y = max(w, n - w);
    cout << 4 * x * y << '\n';
}
signed main(){
    ACPC
    int q = 1;
//    cin >> q;
    while(q--)
        doShit();

    return 0;
}