#include using namespace std; using ll = long long; using Graph = vector>; long long GCD(long long a,long long b) { if(a%b == 0) return b; return GCD(b,a%b); } int main() { int N; cin >> N; int count = 0; for(int i = 0;i < N; i++) { for(int j = 0; j < N; j++) { if(N - (i + j) >= 0) { count++; } } } cout << count + 2<< endl; }