You are given an integer N (where N is not less than 3). Find the sum of the interior angles of a regular polygon with N sides. Print the answer in degrees without units. The input is given as N, and the output should be an integer representing the sum of the interior angles of the polygon. The constraints are 3 ≤ N ≤ 100.

# Buggy version:
def resolve():
    n = int(input())
    ans = (n-2)*180
    print(ans)

# Fixed version:
def resolve():
    n=int(input())
    print((n-2)*180)
resolve()

# Buggy version:
n = int(input())

print(
	n * (180 - 360 // n)
)


# Fixed version:
n=int(input())
print(n*180-360)

# Buggy version:
N = int(input())
print(180*(n-2)/n)


# Fixed version:
N=int(input())

n=(N-2)*180

print(n)

# Buggy version:
x = int(input)
print((x-2)*180)

# Fixed version:
N = int(input())
x = 180*(N-2)
print(x)

# Buggy version:
# coding: utf-8
import os
import time
import re
import math

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

# Fixed version:
# coding: utf-8
import os
import time
import re
import math
 
N=int(input())
print(180*(N-2))

# Buggy version:
#!/usr/bin/env python
# coding: utf-8

# In[ ]:


import sys
#input = sys.stdin.readline
#A, B = map(int, input().split())
180*(int(input())-2)



# Fixed version:
#!/usr/bin/env python
# coding: utf-8

# In[ ]:


import sys
#input = sys.stdin.readline
#A, B = map(int, input().split())
print(180*(int(input())-2))

# Buggy version:
N = int(input())

print((180 - 360/N) * N)

# Fixed version:
N = int(input())

print(N*180-360)

# Buggy version:
n = input()
x = (n-2)*180
print(x)

# Fixed version:
n=int(input())

x=180*(n-2)

print(x)

# Buggy version:
# sys.stdin.readline()
import sys
input = sys.stdin.readline

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

# Fixed version:
# sys.stdin.readline()
import sys
input = sys.stdin.readline

n = int(input())
print(180+(n-3)*180)

# Buggy version:
int(input())
s = 180 * (n - 2)

print(s)
print(type(n))


# Fixed version:
n = int(input())
s = 180 * (n-2)
print(s)

# Buggy version:
int(input())
s = 180 * (n - 2)

print(s)


# Fixed version:
s=int(input())
print(180*(s-2))

# Buggy version:
print(int(input()-2)*180)

# Fixed version:
print(180*(int(input()) - 2))

# Buggy version:
i = int(input())
degree = 180 * (i - 2)
print(degree

# Fixed version:
i = int(input())
print((i-2)*180)

# Buggy version:
n = int(input())

print((180*n)-2)

# Fixed version:
n = int(input())
p = 180*(n-2)
print(p)

# Buggy version:
N = int(input())

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

# Fixed version:
N = int(input())



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

# Buggy version:
n = int(input())
print((n-3) * 180)


# Fixed version:
n = int(input())
print(180 + 180 * (n - 3))

# Buggy version:
n = input()
ans = (n-2)*180
print(ans)


# Fixed version:
n = int(input())

ans = (n-2)*180

print(ans)

# Buggy version:
N = int(input())
print(180*(N-2)/N)


# Fixed version:
N = int(input())

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

# Buggy version:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    n = I()
    print(180*(n-1))
    return

#B
def B():
    n = I()

    return

#C
def C():
    n = I()
    return

#D
def D():
    n = I()
    return

#E
def E():
    n = I()
    return

#F
def F():
    n = I()
    return

#Solve
if __name__ == "__main__":
    A()


# Fixed version:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    n = I()
    print(180*(n-2))
    return

#B
def B():
    n = I()

    return

#C
def C():
    n = I()
    return

#D
def D():
    n = I()
    return

#E
def E():
    n = I()
    return

#F
def F():
    n = I()
    return

#Solve
if __name__ == "__main__":
    A()

# Buggy version:
A = int(input())
print(180*(n-2))

# Fixed version:
n = int(input())
print(180 * (n-2))