AOJ 803.魔方

 1 /*
 2 By:OhYee
 3 Github:OhYee
 4 Email:oyohyee@oyohyee.com
 5 */
 6 #include <cstdio>
 7 #include <algorithm>
 8 #include <cstring>
 9 #include <cmath>
10 #include <string>
11 #include <iostream>
12 #include <vector>
13 #include <list>
14 #include <stack>
15 using namespace std;
16  
17 #define REP(n) for(int o=0;o<n;o++)
18  
19  
20 int main() {
21     int n;
22     while(scanf("%d",&n) != EOF)
23         printf("%d\n",n==1?1:6*n*n-12*n+8);
24     return 0;
25 }