#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n;
    cin >> n;
    int32_t ans = 0;
    for (auto i = 0; i <= n; ++i) {
        for (auto j = 0; j <= n; ++j) {
            auto k = n - i - j;
            if (0 <= k && k <= n)
                ++ans;
        }
    }
    cout << ans << endl;
    return 0;
}