Problem:
 Score : 100 points    Problem Statement Given an integer N not less than 3 , find the sum of the interior angles of a regular polygon with N sides.  Print the answer in degrees, but do not print units.      Constraints  3 \leq N \leq 100         Input Input is given from Standard Input in the following format:  N       Output Print an integer representing the sum of the interior angles of a regular polygon with N sides.        Sample Input 1 3      Sample Output 1 180  The sum of the interior angles of a regular triangle is 180 degrees.       Sample Input 2 100      Sample Output 2 17640

Solution (Python):



import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n = I()
print(180*(n-2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
n=int(input())
print(180*n-360)

Solution (Python):
N = int(input())

print(180 * (N-2))

Solution (Python):



N = int(input())



print(180 * (N - 2))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
n=int(input())
print(n*180-360)

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
n = int(input())
print(180*(n - 2))

Solution (Python):
n = int(input())
print((n-2) * 180)

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
n=int(input())
print(180*(n-2))

Solution (Python):
N = int(input())

print((N-2) * 180)

Solution (Python):
N = int(input())
D = {}
D[str(3)] = 180
for i in range(4, N + 1):
  D[str(i)] = D[str(i - 1)] + 180
print(D[str(N)])

Solution (Python):

print(180*(int(input())-2))

Solution (Python):
N=int(input())
print(180*(N-2))

Solution (Python):
b = int(input())
a = b-int(2)

print(a*int(180))

Solution (Python):
n = int(input())
print(180*(n -2))

Solution (Python):
N = int(input())
print(180 * (N - 2))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
n = int(input())

print(180*(n-2))

Solution (Python):
N = int(input())
print(180 * (N - 2))

Solution (Python):
N = int(input())

ans = 180 * (N - 2)

print(ans)

Solution (Python):
print int(input())*180-360

Solution (Python):
print((int(input()) - 2) * 180)

Solution (Python):
print(180 * (int(input()) - 2))

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
print(180 * (int(input())-2))

Solution (Python):
N = int(input())
r = 180 * (N-2)
print(r)

Solution (Python):


import sys
import copy

sys.setrecursionlimit(1000000)





N = int(input())

print(180 * (N - 2))

Solution (Python):
def solve(n):
    return 180 * (n - 2)

print(solve(int(input())))

Solution (Python):
N = int(input())
print(180 * (N-2))

Solution (Python):
n = int(input())
print(180 * (n-2))

Solution (Python):
import numpy as np

N = int(input())

print((N-2)*180)

Solution (Python):
N = int(input())

print((N - 2)*180)

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
print(int(input())*180-360)

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
N = int(input())
print((N - 2) * 180)

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):
N = int(input())
print((N-2) * 180)

Solution (Python):
print(int(input())*180-360)

Solution (Python):




N = int(input())

print(180*(N-2))

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):
N= int(input())
ans = 180*(N-2)
print(ans)

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
N = int(input())
print(180 * (N - 2))

Solution (Python):
print((int(input()) - 2) * 180)

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
import sys
n = int(sys.stdin.readline().rstrip())
print((n-2)*180)

Solution (Python):
n=int(input())
print(180*(n-2))

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
N=int(input())
print((N-2)*180)

Solution (Python):
num = int(input())
print((180*num)-360)

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
N = int(input())

print(180*N-360)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
N=int(input())
print((N-2)*180)

Solution (Python):
from sys import exit

N = int(input())

print(180 * (N - 2))

Solution (Python):
n = int(input())

print((n-2)*180)

Solution (Python):
print(180 * (int(input()) - 2))

Solution (Python):
a = int(input())
s = (a-2)*180
print(s)

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):
n = int(input())
print(180 * (n - 2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
n = int(input())
print((180*(n-2)))

Solution (Python):
N = int(input())
print(180 * N - 360)

Solution (Python):
n = int(input())

print((n - 2) * 180)

Solution (Python):
print((int(input())-2) * 180)

Solution (Python):


"""
oj dl https://atcoder.jp/contests/abc116/tasks/abc116_d -d test-d
oj test -d test-d -c "python abc116d.py"
oj test -d test-d -c "python abc116d.py" test-d/sample-3.in
"""
from collections import defaultdict
import sys
import math
from datetime import datetime

def sol(n):
    
    
    
    
    

    return int((180 - (360 / n)) * n)


do_submit = True


def input_parse(input_str):
    lines = [x.strip() for x in input_str.split("\n") if x.strip()]
    parsed_lines = [list(map(str, line.split())) for line in lines]
    print(parsed_lines)
    n = int(parsed_lines[0][0])
    
    
    
    return n


if not do_submit:
    n = input_parse("""
    3
    """)
    print(sol(n))

    n = input_parse("""
    100
    """)
    print(sol(n))

else:
    
    
    
    n = int(input().strip())
    
    print(sol(n))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
n = int(input())
print((n - 2) * 180)

Solution (Python):
n = int(input())
s = 180 * (n - 2)
print(s)

Solution (Python):
print((int(input()) - 2) * 180)

Solution (Python):
a = int(input())
print(180*(a-2))

Solution (Python):
n = int(input())
print(180 * (n - 2))

Solution (Python):
N = int(input())
print((N - 2) * 180)

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
import sys
input = sys.stdin.readline

N, = map(int, input().split())
print((N - 2) * 180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
print(int(input())*180-360)

Solution (Python):
a=int(input())
print((a-2)*180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):
N=int(input())
print(180*(N-2))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
i = int(input())
degree = 180 * (i - 2)
print(degree)

Solution (Python):
N = int(input())

result = (N - 2) * 180

print(result)

Solution (Python):
N = int(input())

print(180*(N-2))

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):

import sys


def solve(N: int):
    print(180*(N-2))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
print((n - 2) * 180)

Solution (Python):

N = int(input())


print(180 * (N-2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
n = int(input())
print((n-2) * 180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
q = int(input())
print((q-2)*180)

Solution (Python):



import math
import statistics

n = int(input())
print(180 * (n - 2))

Solution (Python):
n = int(input())
print(180 * (n - 2))

Solution (Python):
N=int(input())
print((N-2)*180)

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
a = int(input())
print(180*(a-2))

Solution (Python):
n=int(input())
n=n-2
print(n*180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
n = int(input())

print(180 * (n-2))

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
n = int(input())

print(180*(n-2))

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
n = int(input())

print(180*(n-2))

Solution (Python):


import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy





n = int(input())

print((n - 2) * 180)

Solution (Python):
N = int(input())

print(180 * (N-2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):
n=int(input())
print(180*(n-2))

Solution (Python):
a = int(input())
print((a-2)*180)

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):


from collections import deque
import itertools as ite
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

N = input()
print (N - 2) * 180

Solution (Python):
n = int(raw_input())
print (n-2)*180

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
n=int(input())
print(180*(n-2))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
n=int(input())
print(180*(n-2))

Solution (Python):
n=int(input())
print(180*n-360)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
a=int(input())
print(a*180-360)

Solution (Python):
n = int(input())
print(180 * (n-2))

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
n = int(input())
print((n - 2) * 180)

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
N = int(input())
print(180 * (N - 2))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
N = int(input())

print((N-2)*180)

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
N=int(input())
print ((N-2)*180)

Solution (Python):



def main():
    n = int(input())
    print((n - 2) * 180)


if __name__ == '__main__':
    main()

Solution (Python):
print(180 * (int(input()) - 2))

Solution (Python):
x = int(input())
print((x-2)*180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
import sys
N = int(input())
print(180 * (N-2))

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):

import fractions
n = int(input())
ans = n * (180 - fractions.Fraction(360, n))
print(ans)

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):

N = int(input())
print(180*(N-2))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
a=int(input())
print(180*(a-2))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
N=int(input())
print((N-2)*180)

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
n = int(input())
ans = (n-2)*180
print(ans)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
N = int(input())

print((N - 2) * 180)

Solution (Python):
N = int(input())
print(str(180*(N-2)))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
N = int(input())
if N >= 3:
	print( 180*N - 360)
else:
  pass

Solution (Python):
input_num = int(input())
sum_of_inner_corner = 180 * (input_num - 2)
print(sum_of_inner_corner)

Solution (Python):

n = int(input())
count = 180 - 360 / n
print( int(count * n) )

Solution (Python):
print(int(180*int(input())- 360))

Solution (Python):
a=int(input())
print((a-2)*180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
N=int(input())
print(180*(N-2))

Solution (Python):
N = int(input())

print('{}'.format((N-2)*180))

Solution (Python):
a = int(input())
print((a-2)*180)

Solution (Python):
N = int(input())
print(180*N-180*2)

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
import sys

N = int(input())
sum_rad = (N - 2)*180
print(sum_rad)

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
N = int(input())
print((N - 2) * 180)

Solution (Python):
n = int(input())
ans = int(180*(n-2))
print(ans)

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):
n = int(input())

ans = 180*(n-2)

print(ans)

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):
N = int(input())

ans = (N - 2) * 180

print('{}'.format(ans))

Solution (Python):
n = int(input())
print((n-2)* 180)

Solution (Python):
N = int(input())
print(180*(N - 2))

Solution (Python):
print((int(input()) - 2) * 180)

Solution (Python):
n=int(input())
ans=180*n-360
print(ans)

Solution (Python):
print(180 *  (int(input()) - 2))

Solution (Python):
n = int(input())

print(int(180*(n-2)))

Solution (Python):
a = int(input())

print((a - 2)*180)

Solution (Python):
N=int(input())
a=180*(N-2)
print(a)

Solution (Python):



def readInt():
    return int(input())

def readList():
    return list(input().split())

def readListI():
    return list(map(int, input().split()))

def main():
    n = readInt()
    print((n-2)*180)


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):

n= int(input())
print(180*(n-2))

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):


N = int(input())

print(int(180*(N-2)))

Solution (Python):
n = int(input())

print(180 * (n - 2))

Solution (Python):
N=int(input())
print(180*N-360)

Solution (Python):
N = int(input())

print(180*(N-2))

Solution (Python):
n = int(input())
print(180 * (n - 2))

Solution (Python):
print(180 * (int(input()) - 2))

Solution (Python):
N = int(input())
print((N-2) * 180)

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
argN = int(input())
print(180 * (argN - 2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
N=int(input())
print((N-2)*180)

Solution (Python):
n = int(input())

def polygon(n):
    return 180 * (n-2)

print(polygon(n))

Solution (Python):
N = int(input())

print(180 * N - 360)

Solution (Python):
n = int(input())
print(180 * (n - 2))

Solution (Python):
a = int(input())
print(180*(a-2))

Solution (Python):
from sys import stdin
import numpy as np

N = int(stdin.readline())

print( (N-2) * 180)

Solution (Python):
N=int(input())
print(180 * (N - 2))

Solution (Python):
def main():
    N = int(input())
    print((N-2) * 180)
main()

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
print((int(input()) - 2) * 180)

Solution (Python):

l = int(input())
print(180*(l-2))

Solution (Python):
N = int(input())

print(180*(N-2))

Solution (Python):
N=int(input())
x=180*(N-2)
print(x)

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):
N = int(input())
r = (N-2)*180
print(r)

Solution (Python):
deg = int(input())
indegree = ( 180 * (deg - 2) ) / deg
print(int(indegree*deg))

Solution (Python):
n = int(input())
print((n-2) * 180)

Solution (Python):
n=int(input())
p=(n-2)*180
print(p)

Solution (Python):
N = int(input())
ans = (N-2) * 180
print(ans)

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
n = int(raw_input())
print (n - 2) * 180

Solution (Python):
N = int(input())
print(180 * (N - 2))

Solution (Python):

a = int(input())
result = 180 * (a - 2)
print(result)

Solution (Python):
N = input()
print 180*(N-2)

Solution (Python):
n = int(input())
answer = 180 * (n - 2)

print(answer)

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
N=int(input())

print((N-2)*180)

Solution (Python):
N=int(input())

n=(N-2)*180

print(n)

Solution (Python):
n = int(input())

print(180*(n-2))

Solution (Python):
def main():
    N = int(input())
    print(180 * (N - 2))

if __name__ == '__main__':
    main()

Solution (Python):

import sys;
import string;
sys.setrecursionlimit(20000) 

import copy
import itertools

from functools import lru_cache



n = int(input())
print((n-2)*180)

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
N = int(input())
print(180 * (N-2))

Solution (Python):
N = int(input())
x = 180*(N-2)
print(x)

Solution (Python):



a = int(input())

sum = 180*(a-2)

print(str(sum))

Solution (Python):
N=int(input())
ans=180*(N-2)
print(ans)

Solution (Python):
n=int(input())

print((n-2)*180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):

def input_from_console():
    n = int(input())
    return n


def solve(n):

    return int(180 * (n-2))


def main():
    n = input_from_console()
    print(solve(n))


if __name__ == "__main__":
    import sys

    if sys.gettrace():  
        check_cases()
    else:
        main()

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
def main():
    n = int(input())
    print(180 * (n - 2))

main()

Solution (Python):
N = int(input())

print ((N-2)*180)

Solution (Python):
a=int(input())
print((a-2)*180)

Solution (Python):
N=int(input())
ans=180*(N-2)
print(ans)

Solution (Python):
n=int(raw_input())
print (n-2)*180

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
N=int(input())
T=(N-2)*180
print(T)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
N=int(input())
print(180*(N-2))

Solution (Python):
N=int(input())
print(180 * (N - 2))

Solution (Python):
X= input()
Z = int(X)
print((Z-2)*180)

Solution (Python):
N=int(input())
print(180*(N-2))

Solution (Python):
N = int(input())						

print( (N-2)*180 )

Solution (Python):
a = int(input())
print((a-2)*180)

Solution (Python):
N = int(input())
print(180*N - 360)

Solution (Python):
N = int(input())
A = (N-2) * 180
print(A)

Solution (Python):
n= int(input())
print(180*(n-2))

Solution (Python):
n=int(input())
n=180*(n-2)
print(n)

Solution (Python):
n=input("")
a=180*(int(n)-2)
print(a)

Solution (Python):
print((int(input()) - 2) * 180)

Solution (Python):
n = int(input())

print(
	180 * (n - 2)
)

Solution (Python):
N=int(input())
ans=180*(N-2)
print(ans)

Solution (Python):
N = int(input())

rtn = 180 *  (N-2) /N
print(int(rtn*N))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
N=int(input())
print(180*(N-2))

Solution (Python):
n = int(input())
print(180 * (n - 2))

Solution (Python):
n=int(input())
print(180*(n-2))

Solution (Python):
n=int(input())
print(180*(n-2))

Solution (Python):
from __future__ import print_function


import sys
input = sys.stdin.readline

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd

def lcm(n,m):
    return int(n*m/gcd(n,m))

import re
import array
import copy
import functools
import operator

import collections
import itertools
import bisect
import heapq


from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace

from queue import PriorityQueue as pq



import random


def main():
    n = int(input())
    print(180*(n-2))
    return

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
print((n -2) * 180)

Solution (Python):
print(180 * int(input()) - 360)

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
n = int(input())
y = (n-2) * 180
print(y)

Solution (Python):
n = int(input())
print(180 * (n - 2))

Solution (Python):
from sys import stdin

n = int(stdin.readline().rstrip())

print((n-2)*180);

Solution (Python):
n=int(input())
print((180*(n-2)))

Solution (Python):
print(180 * (int(input()) - 2))

Solution (Python):
a = int(input())
a = a-2
a = a*180

print(a)

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
degree = (int(input())-2)*180
print(degree)

Solution (Python):
n = int(input())
print(180 * (n-2))

Solution (Python):
def main():
    print(180 * (int(input())-2))

if __name__=='__main__':
    main()

Solution (Python):
n = int(input())
print(180 * (n - 2))

Solution (Python):
S = int(input())

ans = (S-2)*180
print("{}".format(ans))

Solution (Python):
N=int(input())
print(180*(N-2))

Solution (Python):
N = int(input()); print(180 * (N - 2))

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
N=int(input())

print(180*(N-2))

Solution (Python):
n = int(input())

print((n-2)*180)

Solution (Python):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

t = readi()
print((t - 2) * 180)

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
print(180 * (int(input()) - 2))

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
S =int(raw_input())
print (S-2)*180

Solution (Python):
N = int(input())
print(int(180 * (N - 2)))

Solution (Python):
n = int(input())
print(180 * (n - 2))

Solution (Python):
print(180 * (int(input()) - 2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):



N = int(input())

print(180 * (N - 2))

Solution (Python):

a = int(input())
print ((a-2)*180)

Solution (Python):
def sum_of_interior_angles(N: int)->int:
    return (N-2) * 180


if __name__ == "__main__":
    N = int(input())

    ans = sum_of_interior_angles(N)
    print(ans)

Solution (Python):
n = int(input())
print((n-2) *180)

Solution (Python):
print ((int(input()) - 2) * 180)

Solution (Python):
n = int(input())
print(180 * (n - 2))

Solution (Python):
N = int(input())
answer = (N - 2) * 180
print(answer)

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):
N = int(input())

print(180 * (N - 2))

Solution (Python):


a = int(input())
sum = 180 + (a - 3) * 180
print(sum)

Solution (Python):
ans = 180*(int(input())-2)
print(ans)

Solution (Python):
n = int(input())

print(180*(n-2))

Solution (Python):
N = int(input())
print(180 * (N - 2))

Solution (Python):


import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]


    token = lines[0].split()
    n = int(token[0])

    return (n, )


def solve(n, ):

        
    return int(((180 - (360 / n)) / 2 ) * 2 * n) 




def main():
    

    print("%s" % solve(*parse_input()))

if __name__ == '__main__':

    main()

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
N=int(input())
print((N-2)*180)

Solution (Python):
n = int(input())

print((n - 2) * 180)

Solution (Python):
N = int(input())

a = 180 * (N-2)
print(a)

Solution (Python):
print(180 * int(input()) - 360)

Solution (Python):
n=int(input())
ans=(n-2)*180
print(ans)

Solution (Python):

N = int(input())

print((N-2)*180)

Solution (Python):

import os
import time
import re
import math
 
N=int(input())
print(180*(N-2))

Solution (Python):
n = int(input())

print((n-2)*180)

Solution (Python):
n = int(input())
x = (n-2)*180
print(x)

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):

n = int(input())

print(180 * (n - 2))

Solution (Python):
a = int(input())
print((a-2)*180)

Solution (Python):
N = int(input())

print(int(180*(N-2)))

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
N = int(input())

print(180*(N-2))

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
def lmi(): return list(map(int, input().split()))

n = int(input())
print(180*n -360)

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
n = int(input())
gaigaku = 360/n
naikaku = 180 - gaigaku
ans = naikaku * n

print(int(ans))

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
N = int(input())

print(180 * (N - 2))

Solution (Python):
N = int(input())

print(180 * (N - 2))

Solution (Python):
print((int(input()) - 2) * 180)

Solution (Python):
N=int(input())
print((N-2)*180)

Solution (Python):
num1 = int(input())

re1 = 180 * (num1-2)

print(re1)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
a = int(input())
b = a - 2
print(180 * b)

Solution (Python):


n = int(input())
print(180 * (n-2))

Solution (Python):
N=int(input())

print((N-2)*180)

Solution (Python):
n = int(input())
print((n - 2) * 180)

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
a = int(input())
print(180*(a-2))

Solution (Python):


''' 
------------------------
author : iiou16
------------------------
'''

def main():
    N = int(input())

    print(180*(N-2))


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
ans=180*(n-2)
print(ans)

Solution (Python):
n = int(input())
print("{}".format((n-2)*180))

Solution (Python):
N = int(input())
print(180 * (N-2))

Solution (Python):
N = int(input())

print(180 * (N - 2))

Solution (Python):

n = int(input())
ans = (n - 2) * 180
print(ans)

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
n = int(input())
ans = 180 * (n - 2)
print(ans)

Solution (Python):
N = int(input())
print(int((180-360/N)*N))

Solution (Python):
def main():
    N = int(input())

    print(180 * (N - 2))


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())

print((N - 3) * 180 + 180)

Solution (Python):






import sys


print(180*(int(input())-2))

Solution (Python):
print(180 * (int(input()) - 2))

Solution (Python):


import math
import sys
import itertools
import numpy as np


n =int(input())

print((n-2)*180)

Solution (Python):
N = int(input())
print(180 * (N - 2))

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):
n = int(input())

ans = 180*(n-2)

print(ans)

Solution (Python):
a = int(input())

angle = 180 * (a - 2)

print(angle)

Solution (Python):


N = int(input())

print(180 * (N-2))

Solution (Python):
N = int(input())
print(int(180 * (N - 2)))

Solution (Python):
import itertools as it
import collections as col
import heapq
import sys
sys.setrecursionlimit(10**9)

N=int(input())
print(180*(N-2))
"""
S=list(input())
T=[c for c in S if c == 'o']
print("YES" if len(T) + (15 - len(S)) >= 8 else "NO")
"""

Solution (Python):
import numpy as np

N = int(input())
print(180*(N-2))

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
N = int(raw_input())

print (180 * (N-2))

Solution (Python):
n = int(input())

print(180*(n-2))

Solution (Python):
n = int(input())
print(int(n * (180 - 360 / n)))

Solution (Python):
n = int(input())
print((n-2) * 180)

Solution (Python):

a = int(input())

print(180 * (a-2))

Solution (Python):


N = int(input())

print((N - 2) * 180)

Solution (Python):
N = int(input())
print((N-2) * 180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
N=int(input())

print((N-2)*180)

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
N=int(input())
print((N-2)*180)

Solution (Python):
n = int(input())

print(180*(n-2))

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
n = int(input())

ans = 180 * n - 360

print(ans)

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):
N = int(input())
ans = (N-2)*180
print(ans)

Solution (Python):
N = int(input())
print(180 * (N - 2))

Solution (Python):
n = int(input())

print((n-2)*180)

Solution (Python):
n=int(input())  
print(int((180-360/n)*n))

Solution (Python):




n = int(input())


ans = 180 * (n - 2)


print(ans)

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
data = list(map(int, input().split()))

print(180 * (data[0] - 2))

Solution (Python):

N = int(input())

ans = (N - 2) * 180

print(ans)

Solution (Python):




def main():
	n = int(input())
	print(180*(n-2))


if __name__ == '__main__':
	import sys
	sys.exit(main())

Solution (Python):
N = int(input())
print((N - 2) * 180)

Solution (Python):
N = int(input())
ans = 180 * (N - 2)
print(ans)

Solution (Python):
N = int(input())
print((N-2)*180)

Solution (Python):


import math

def main():
    n = int(raw_input())
    if n == 3:
        print 180
    else:
        print 180 * (n-2)

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
print((n-2)*180)

Solution (Python):
N = int(input())

print(180*(N-2))

Solution (Python):
print(180*(int(input())-2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
N= int(input())

angle = 180 * (N - 2)

print(angle)

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
n=int(input())
 
print((n-2)*180)

Solution (Python):
n = int(input())
print(180 * (n-2))

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
n = int(input())

print((n - 2 )*180)

Solution (Python):
N = int(input())

print(180 * N - 360)

Solution (Python):
n=int(input())
print((n-2)*180)

Solution (Python):
N = int(input())

print(180*(N-2))

Solution (Python):
N=int(input())
print(180*(N-2))

Solution (Python):
n = int(input())

print(180*(n-2))

Solution (Python):
N = int(input())
print(180*(N-2))

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
print((int(input())-2)*180)

Solution (Python):
n=int(input())

a=(n-2)*180

print(a)

Solution (Python):
n = int(input())
print(180*(n-2))

Solution (Python):
n = int(input())

print(180*(n-2))

Solution (Python):



def main():
    n = int(input())
    print((n-2) * 180)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
print(180*(n-2))