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



Sample input:
3


Sample output:
180

Submission status: Accepted

Solution code:
n = int(input())

print(180 * (n - 2))

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = int(input())
print((n-2)*180)

Submission status: Accepted

Solution code:
from sys import stdin
N = int(stdin.readline().rstrip())
print(180*(N-2))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

N = int(input())

print(180 * (N - 2))

Submission status: Accepted

Solution code:
k=int(input())
print((k-2)*180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

print(180*(n-2))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
N = int(input())
#S = str(input())

print (180*(N-2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

print((n-2)*180)

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    print((I()-2)*180)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    print((I()-2)*180)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import sys
if sys.platform =='ios':
	sys.stdin=open('input.txt')

n = int(input())

print((n-2)*180)

Submission status: Accepted

Solution code:
def main(n: int):
    print(180 * (n - 2))


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

    main(n)

Submission status: Accepted

Solution code:
N=int(input())

print(180*N-360)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    N = I()
    ans = 180*(N-2)
    print(ans)


import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

Solution code:
n  = int(input())
print((2*n-4)*90)

Submission status: Accepted

Solution code:
#Sum of Interior Angles
N = int(input())
print(180*(N-2))

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n = int(readline())
    print((n - 2) * 180)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

Submission status: Accepted

Solution code:
# M-SOLUTIONS プロコンオープン: A – Sum of Interior Angles
n = int(input())
print((n - 2) * 180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# N, K = map(int, input().split())
N = int(input())
print(180 * (N -2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    print((n - 2) * 180)


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Takes in n (number of sides).
n = int(input())

# Prints out sum of interior angles using formula (n-2)180 from geometry.
print((n-2)*180)

Submission status: Accepted

Solution code:
import sys
sides = int(input())
if sides < 3 or sides > 100:
  sys.exit()
print((sides-2)*180)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
def resolve():
    n = int(input())
    print(180 * (n - 2))


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
 
def main():
    N = int(input())
    print(180*(N-2))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#M-SOLUTIONS プロコンオープン A

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))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

N = int(input())

# print(N)

print(180 * (N - 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print((N-2) * 180)

Submission status: Accepted

Solution code:
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)])

Submission status: Accepted

Solution code:
#11 M-SOLUTIONS
print(180*(int(input())-2))

Submission status: Accepted

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

print(a*int(180))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = 180 * (N - 2)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys
import copy

sys.setrecursionlimit(1000000)

# input = sys.stdin.readline

# ~~~~~~~~~~~~~~~~~~~~~_(＾～＾ ｣ ∠)_~~~~~~~~~~~~~~~~~~~~~

N = int(input())

print(180 * (N - 2))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())

print((N-2)*180)

Submission status: Accepted

Solution code:
N = int(input())

print((N - 2)*180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#正N角形の内角の和

N = int(input())

print(180*(N-2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(180*N-360)

Submission status: Accepted

Solution code:
from sys import exit

N = int(input())

print(180 * (N - 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print((n - 2) * 180)

Submission status: Accepted

Solution code:
#-*- coding: utf-8
#  -*-
"""
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):
    # 3 -> 3 * 60 = 180
    # 4 -> 4 * 90 = 360
    # 5 -> 5 *
    # 360 / 5 = 180 - 72 = 108 = 54 * 2 * 5
    # (180 - (360 / 5)) * 5

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


do_submit = True
#do_submit = False

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])
    # k = int(parsed_lines[0][1])
    # S = parsed_lines[1][0]
    # return n, k, S
    return n


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

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

else:
    # n, k = list(map(int, input().split()))
    # S = input().split()
    # print(sol(n, k, S))
    n = int(input().strip())
    # S = input().strip()
    print(sol(n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

result = (N - 2) * 180

print(result)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#input
N = int(input())

#output
print(180 * (N-2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# user: herp_sy

import math
import statistics

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(180 * (n-2))

Submission status: Accepted

Solution code:
# 参考: https://qiita.com/y-tsutsu/items/aa7e8e809d6ac167d6a1

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

# 多次元配列
# dp = [[0] * 3 for _ in range(5)]

# 入力を受け取る
n = int(input())

print((n - 2) * 180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env 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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import fractions
n = int(input())
ans = n * (180 - fractions.Fraction(360, n))
print(ans)

Submission status: Accepted

Solution code:
#A問題
N = int(input())
print(180*(N-2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print((N - 2) * 180)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = 180*(n-2)

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

ans = (N - 2) * 180

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
a = int(input())

print((a - 2)*180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

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()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n= int(input())
print(180*(n-2))

Submission status: Accepted

Solution code:
# coding:utf-8

N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

print(polygon(n))

Submission status: Accepted

Solution code:
N = int(input())

print(180 * N - 360)

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np

N = int(stdin.readline())

print( (N-2) * 180)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
result = 180 * (a - 2)
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

print(answer)

Submission status: Accepted

Solution code:
N=int(input())

print((N-2)*180)

Submission status: Accepted

Solution code:
N=int(input())

n=(N-2)*180

print(n)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys;
import string;
sys.setrecursionlimit(20000) # 再起呼び出しの最大数をセット

import copy
import itertools

from functools import lru_cache
#@lru_cache(maxsize = None)

# 整数の入力
n = int(input())
print((n-2)*180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# 整数入力
a = int(input())
# スペース区切りの整数入力
sum = 180*(a-2)
#出力
print(str(sum))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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 if the python interpreter is in debug mode or not.
        check_cases()
    else:
        main()

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
N = int(input())

print ((N-2)*180)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())						# 5

print( (N-2)*180 )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(
	180 * (n - 2)
)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
from __future__ import print_function
# import numpy as np
# import numpypy as np
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

# from itertools import accumulate
# from collections import deque
import random


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

print((n-2)*180);

Submission status: Accepted

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

Submission status: Accepted

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

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
S = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

print(180*(N-2))

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

N = int(input())

print(180 * (N - 2))

Submission status: Accepted

Solution code:
#coding:utf-8
a = int(input())
print ((a-2)*180)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(180 * (N - 2))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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()

Submission status: Accepted

Solution code:
n = int(input())

print((n - 2) * 180)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = int(input())

print((N-2)*180)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())

print(180 * (n - 2))

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num1 = int(input())

re1 = 180 * (num1-2)

print(re1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
N=int(input())

print((N-2)*180)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
''' 
------------------------
author : iiou16
------------------------
'''

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

    print(180*(N-2))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
ans = (n - 2) * 180
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    print(180 * (N - 2))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
#!/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))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 
import math
import sys
import itertools
import numpy as np

# いっこ入力
n =int(input())

print((n-2)*180)

Submission status: Accepted

Solution code:
n = int(input())

ans = 180*(n-2)

print(ans)

Submission status: Accepted

Solution code:
a = int(input())

angle = 180 * (a - 2)

print(angle)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

N = int(input())

print(180 * (N-2))

Submission status: Accepted

Solution code:
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")
"""

Submission status: Accepted

Solution code:
import numpy as np

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

Submission status: Accepted

Solution code:
N = int(raw_input())

print (180 * (N-2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#入力取得
a = int(input())

print(180 * (a-2))

Submission status: Accepted

Solution code:
#A

N = int(input())

print((N - 2) * 180)

Submission status: Accepted

Solution code:
n = int(input())

ans = 180 * n - 360

print(ans)

Submission status: Accepted

Solution code:
n=int(input())  #数値入力
print(int((180-360/n)*n))

Submission status: Accepted

Solution code:
# 2019/06/01
# M-SOLUTIONS プロコンオープン - A

# Input
n = int(input())

# Calc
ans = 180 * (n - 2)

# Output
print(ans)

Submission status: Accepted

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

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