fork(1) download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
  5.  
  6. #define int long long
  7. #define pb push_back
  8. #define ff first
  9. #define ss second
  10. #define all(x) (x).begin(), (x).end()
  11. #define rall(x) (x).rbegin(), (x).rend()
  12. #define sz(x) ((int)(x).size())
  13. #define endl '\n'
  14. #define yes cout << "yes\n"
  15. #define no cout << "no\n"
  16.  
  17. #define rep(i,a,b) for(int i=a;i<b;++i)
  18. #define per(i,a,b) for(int i=b-1;i>=a;--i)
  19. #define each(x, a) for (auto& x : a)
  20.  
  21. const int INF = 1e18;
  22. const int MOD = 1e9+7;
  23. const int N = 2e5 + 5;
  24.  
  25. int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
  26. int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
  27.  
  28. int power(int a, int b, int m = MOD) {
  29. int res = 1;
  30. while (b > 0) {
  31. if (b & 1) res = res * a % m;
  32. a = a * a % m;
  33. b >>= 1;
  34. }
  35. return res;
  36. }
  37.  
  38. int modinv(int a, int m = MOD) {
  39. return power(a, m - 2, m);
  40. }
  41.  
  42. void solve() {
  43. int n;
  44. cin >> n;
  45.  
  46. if (n == 1) {
  47. cout << 1 << endl;
  48. return;
  49. }
  50.  
  51. if (n == 2) {
  52. cout << 9 << endl;
  53. return;
  54. }
  55.  
  56. int result = 4 * n * n - n - 4;
  57. cout << result << endl;
  58. }
  59.  
  60. int32_t main() {
  61. fast_io;
  62.  
  63. int t;
  64. cin >> t;
  65. while (t--) {
  66. solve();
  67. }
  68.  
  69. return 0;
  70. }
Success #stdin #stdout 0.01s 5320KB
stdin
5
1
2
3
4
5
stdout
1
9
29
56
91