Problem p03023 (C++)

Buggy submission (status: Runtime Error):
/*------------------------Original Copyright belongs
to-------------------------/ !
! !      ##  ##                                                		## ##
! !      #   #
#   #		!
!      				 ###  ####  ###   ###     ##         # ! !
#     #  #  #  #  #  #   #  #       ##                      !
!					#	  #  #  ###   ###    #### # ! !
#     #  #  #  #  #  #   #  #        #                      !
!					 ###  ####  ###   #   #  #  #  ###  ###
! ! !
/------------------------------------------------------------------------------*/
#include <bits/stdc++.h>
using namespace std;
//------------Template begins--------------------//
#define ss string
#define last(s) s.length() - 1
#define lli long long int
#define v(type) vector<type>
#define pr(type1, type2) pair<type1, type2>
#define ma(type1, type2) map<type1, type2>
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define pb push_back
#define pf push_front
#define mp make_pair
#define L(i, start, end) for (lli i = start; i <= end; i++)
#define R(i, start, end) for (lli i = start; i >= end; i--)
#define inp(var, start, end, array)                                            \
  for (var = start; var <= end; var++)                                         \
    cin >> array[var];
#define whatIs(x) cout << #x << " is " << x << endl
#define dbg1D(i, start, end, arr)                                              \
  for (lli i = start; i <= end; i++)                                           \
    cout << i << "th : " << arr[i] << endl;
#define dbg2D(i, j, s1, e1, s2, e2, arr)                                       \
  for (lli i = s1; i <= e1; i++) {                                             \
    cout << i << "th :";                                                       \
    for (lli j = s2; j <= e2; j++)                                             \
      cout << arr[i][j] << " ";                                                \
    cout << endl;                                                              \
  }

lli dx[4] = {-1, 0, 0, +1};
lli dy[4] = {0, -1, +1, 0};
const lli LINF = 1e18;
const lli INF = 1e9;
const lli mod = 1e9 + 7;
lli power(lli a, lli b, lli m) {
  if (b == 0)
    return 1;
  if (b == 1)
    return a % m;
  lli t = power(a, b / 2, m);
  t = (t * t) % m;
  if (b & 1)
    t = (t * a) % m;
  return t;
}
lli modInverse(lli a, lli m) { return power(a, m - 2, m); }
//---------------Template ends------------------//
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
#ifndef ONLINE_JUDGE
  freopen("ip.txt", "r", stdin);
  freopen("op.txt", "w", stdout);
#endif
  // #################### CATCH HERE ##########################
  /* Uncomment if t test cases
  lli t;
  cin>>t;
  while(t--)
  {
          lli n,ans,i,j;

          cout<<ans<<endl;
  }
  */
  lli n;
  cin >> n;
  cout << ((n - 2) * 180) << endl;
  // cout<<ans<<endl;
  // ##########################################################
  return 0;
}

Fixed submission:
/*------------------------Original Copyright belongs
to-------------------------/ !
! !      ##  ##                                                		## ##
! !      #   #
#   #		!
!      				 ###  ####  ###   ###     ##         # ! !
#     #  #  #  #  #  #   #  #       ##                      !
!					#	  #  #  ###   ###    #### # ! !
#     #  #  #  #  #  #   #  #        #                      !
!					 ###  ####  ###   #   #  #  #  ###  ###
! ! !
/------------------------------------------------------------------------------*/
#include <bits/stdc++.h>
using namespace std;
//------------Template begins--------------------//
#define ss string
#define last(s) s.length() - 1
#define lli long long int
#define v(type) vector<type>
#define pr(type1, type2) pair<type1, type2>
#define ma(type1, type2) map<type1, type2>
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define pb push_back
#define pf push_front
#define mp make_pair
#define L(i, start, end) for (lli i = start; i <= end; i++)
#define R(i, start, end) for (lli i = start; i >= end; i--)
#define inp(var, start, end, array)                                            \
  for (var = start; var <= end; var++)                                         \
    cin >> array[var];
#define whatIs(x) cout << #x << " is " << x << endl
#define dbg1D(i, start, end, arr)                                              \
  for (lli i = start; i <= end; i++)                                           \
    cout << i << "th : " << arr[i] << endl;
#define dbg2D(i, j, s1, e1, s2, e2, arr)                                       \
  for (lli i = s1; i <= e1; i++) {                                             \
    cout << i << "th :";                                                       \
    for (lli j = s2; j <= e2; j++)                                             \
      cout << arr[i][j] << " ";                                                \
    cout << endl;                                                              \
  }

lli dx[4] = {-1, 0, 0, +1};
lli dy[4] = {0, -1, +1, 0};
const lli LINF = 1e18;
const lli INF = 1e9;
const lli mod = 1e9 + 7;
lli power(lli a, lli b, lli m) {
  if (b == 0)
    return 1;
  if (b == 1)
    return a % m;
  lli t = power(a, b / 2, m);
  t = (t * t) % m;
  if (b & 1)
    t = (t * a) % m;
  return t;
}
lli modInverse(lli a, lli m) { return power(a, m - 2, m); }
//---------------Template ends------------------//
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
#ifndef ONLINE_JUDGE
// freopen("ip.txt","r",stdin);
// freopen("op.txt","w",stdout);
#endif
  // #################### CATCH HERE ##########################
  /* Uncomment if t test cases
  lli t;
  cin>>t;
  while(t--)
  {
          lli n,ans,i,j;

          cout<<ans<<endl;
  }
  */
  lli n;
  cin >> n;
  cout << ((n - 2) * 180) << endl;
  // cout<<ans<<endl;
  // ##########################################################
  return 0;
}