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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve():
    s = list(input())
    if s.count("o") >= 8:
        print("YES")
    else:
        print("NO")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
print(int(input())*60)

Submission status: Wrong Answer

Solution code:
print(int(input()*60))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=input()
if s.count("o")<7:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#coding:utf-8
s = input()

if s.count('x') <= 7:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=input()
b=len(s)
a=7-b
for i in range(b):
    if s[i]=="o":
        a+=1
if a>=0:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
n=int(input("enter the number of sides of the polygon"))
if n>=3:
	sum=(n-2)*180
	print("the total sum of the interior angles is: ",sum)
else:
	print("enter the number greater or equal to 3")

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

if s.count('x') < 8:
   print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
n = int(input())

print((180*n)-2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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 (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: Wrong Answer

Solution code:
line = list(input())
win = line.count("o")
#print(len(line),win)
match = 15-len(line)
if win + match > 7:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
S = str(input())
_s = list(S)
_max = 15
_th = 8
_limit = _th - (_max - len(S))
count=0
for _str in _s:
    if(_str == "o"):
        count += 1
if (_limit >= count):
    print('YES')
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N = int(input())
print((N-1)*90)

Submission status: Wrong Answer

Solution code:
N = int(input())
print(N-1*90)

Submission status: Wrong Answer

Solution code:
s = input()
c=0
n = list(map(str, s))

for i in n :
    if i == 'o' :
        c +=1
        
if c >= 8 or (8-c) <= 15 - len(n) :
    print('YES')
else :
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
if input().count("×") > 7 :
    print("NO")
else :
    print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=input()
a=0
b=0
for i in N:
    if i=='o':
        a+=1
    elif i=='x':
        b+=1
if a>=b or a>=8:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
num = S.count("○")
if num >= 8 :
    print("YES")
else :
    print("NO")

Submission status: Wrong Answer

Solution code:
S = input()
num = S.count("○")
print(num)
if num >= 8 :
    print("YES")
else :
    print("NO")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
s = str(input())
ans = list(s)

if len(ans) < 8:
    print('YES')
elif len(ans) - ans.count('o') <= 7:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
n = int(input())

if n == 3:
  print(180)
else:
  print(90*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l = list(map(str, input().split()))
if(l.count("o")>7):
    print("YES")
elif(l.count("x")< 8):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
s=input()
a=s.count("x")
if a>=8:
	print("NO")
else:
	print("YES")

Submission status: Wrong Answer

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

# スペース区切りの整数の入力
#a = [x for x in map(int, input().split())]
#n, m = map(int, input().split())
#print("sp", n, q, file=sys.stderr)

# 改行区切りの整数の入力
#a = []
#for x in range(m):
#  a.append([int(x) for x in input().split()])
#p = [int(x) for x in input().split()]

# 文字列の入力
#s = input()

# 出力
#print("{} {}".format(a+b+c, s))
#a.sort()
#print(set(a), file=sys.stderr)
#print(len(set(a)))

#cache = dict()


def doit(s):
  ok = True
  for x in range(m):
    res = 0
    for y in range(a[x][0]):
      if s[a[x][y+1]-1] == 1:
        res = res + 1
    #print("res", res, file=sys.stderr)
    if res % 2 != p[x]:
      ok = False
      break
  #print("ok", ok, file=sys.stderr)
  return ok

def createSw(n):
  if n <= 1:
    return [[0,], [1,]]

  ret = []
  for x in createSw(n-1):
    #print("sw0", x, file=sys.stderr)
    ret.append(x + [0])
    ret.append(x + [1])
    #print("ret", ret, file=sys.stderr)
  #print("ret", ret, file=sys.stderr)
  return ret

#print(doit([0] * 4))
try:
  res = 0
#  for x in createSw(n):
#  for x in itertools.product(range(2), repeat=n):
#    print("x", x, file=sys.stderr)
#    if doit(x):
#      res = res + 1
  print((n-3)*180)
except Exception as e:
  print("e", e, file=sys.stderr)

Submission status: Wrong Answer

Solution code:
n = int(input())

print(n-2)

Submission status: Wrong Answer

Solution code:
S = input()
r = 0
for s in S:
    if s == "x":
        r += 1
if r < 8:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
l = list(map(str, input().split()))
if(l.count("x") < 8):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
s = input()
count = 0
for i in range(len(s)):
    if s[i] == "〇":
        count += 1
n = 15 - len(s) - count
if n >= 0:
    print("YES")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
N = int(input())

print(180 * (N - 3))

Submission status: Wrong Answer

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

num_win = s.count('o')

num_rest = 15 - len(s)

if num_win + num_rest > 7:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

win = 0
for i in s:
        if i == 'o':
                win += 1

if (15 - len(s)) + win >= 8:
        print('YES')
else:
        print('NO')

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# In[ ]:


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

Submission status: Wrong Answer

Solution code:
n = int(input())

print((n-1)*180)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())

print((n-2)//180)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

Solution code:
# sys.stdin.readline()
import sys
input = sys.stdin.readline

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

Submission status: Wrong Answer

Solution code:
n=int(input())

print((n-2)/180)

Submission status: Wrong Answer

Solution code:
N = int(input())
print(N*60)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print((int(input())-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:
n = int(input())
print((n - 2) * 180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())


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

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:
n=int(input())
print((n-2)*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:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

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:
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
def input():
    return sys.stdin.readline()[:-1]

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

    print(180*(N - 2))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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():
    n = int(input())

    print(180 * n - 360)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N = I()

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
'''
Created on 2020/08/20

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  N=int(pin())
  print((N-2)*180)
  return 

main()

Submission status: Accepted

Solution code:
#M-SOLUTIONS プロコンオープン a
n=int(input())
ans=180*(n-2)
print(ans)

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:
a = int(input())
print(int(a * 180 - 360))

Submission status: Accepted

Solution code:
import sys, math
from functools import lru_cache
sys.setrecursionlimit(500000)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]

def main():
    N = ii()
    print((N-2)*180)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# Date [ 2020-08-11 10:50:12 ]
# Problem [ test.py ]
# Author Koki_tkg

import sys;      from decimal import Decimal
import math;     from collections import Counter
import bisect;   from itertools import combinations

# sys.setrecursionlimit(10 ** 6)
MOD = 10 ** 6 + 7
INF = 10 ** 9
PI = 3.14159265358979323846

def read_str():      return sys.stdin.readline().strip()
def read_int():      return int(sys.stdin.readline().strip())
def read_ints():     return map(int, sys.stdin.readline().strip().split())
def read_str_list(): return list(sys.stdin.readline().strip().split())
def read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))
def lcm(a: int, b: int) -> int: return (a * b) // math.gcd(a, b)

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

if __name__ ==  '__main__':
    Main()

Submission status: Accepted

Solution code:
# Date [ 2020-08-11 10:50:12 ]
# Problem [ test.py ]
# Author Koki_tkg

import sys;      from decimal import Decimal
import math;     from collections import Counter
import bisect;   from itertools import combinations

# sys.setrecursionlimit(10 ** 6)
MOD = 10 ** 6 + 7
INF = 10 ** 9
PI = 3.14159265358979323846

def read_str():      return sys.stdin.readline().strip()
def read_int():      return int(sys.stdin.readline().strip())
def read_ints():     return map(int, sys.stdin.readline().strip().split())
def read_str_list(): return list(sys.stdin.readline().strip().split())
def read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))
def lcm(a: int, b: int) -> int: return (a * b) // math.gcd(a, b)

def Main():
    n = read_int()
    print((n - 2) * 180)

if __name__ ==  '__main__':
    Main()

Submission status: Accepted

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

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:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N = int(readline())
    print(180*(N-2))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
import sys
import collections
import bisect
readline = sys.stdin.readline


def main():
    print((int(readline().rstrip()) - 2) * 180)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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

print((n-2)*180)

Submission status: Accepted

Solution code:
N = int(input())

print(180 * (N - 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
n = int(input())
print(int((180-(360/n))*n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    N=I()
    print((N-2)*180)

main()

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

print((n-2)*180)

Submission status: Accepted

Solution code:
n = int(input())

print((n - 2)*180)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
#from decimal import *

N = INT()

print(180*(N-2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(180*(n-2))

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-2)*180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

a = 180 * (N - 2)

print(a)

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())
print(180*(I()-2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
n = I()
print((180 * (n-2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(180 * (N-2))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

n = int(input())

print(180*(n-2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    print(180 * (int(input()) - 2))
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n = int(readline())
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:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.6 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:
n = int(input())
ans = 180 * (n-2)

print(ans)

Submission status: Accepted

Solution code:
# Problem A - Sum of Interior Angles

# input
N = int(input())

# initialization
ans = 180 * (N - 2)

# output
print(ans)

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:
N = int(input())
print(180 * (N - 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:
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
#%%code
def resolve():
    N=int(input())
    print(180*(N-2))
    
    

#%%submit!
resolve()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():

    n=int(input())

    print(180*(n-2))

resolve()

Submission status: Accepted

Solution code:
N=int(input())

ans=180*N-360
print(ans)

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-2) * 180)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

n = ni()

print(180 * (n - 2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    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:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    n=int(input())
    print(180*(n-2))

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    s=int(input())
    
    print(int((s-2)*180))

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:
N=int(input())
print((180*(N-2)))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import defaultdict
from bisect import *
mod = 10**9+7

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())
print((N-2)*180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
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
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

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

Submission status: Accepted

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

Submission status: Accepted

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


print(ans)