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

ans = (N - 2) * 180

print(ans)

Submission status: Accepted

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


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


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

Submission status: Accepted

Solution code:
# coding:utf-8

import math

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N= int(input())

angle = 180 * (N - 2)

print(angle)

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

Submission status: Accepted

Solution code:
n=int(input())

a=(n-2)*180

print(a)

Submission status: Accepted

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


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


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

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

Submission status: Accepted

Solution code:
input_line = input()
n = int(input_line)

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

Submission status: Accepted

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

n = int(input())

print((n-2)*180)

Submission status: Accepted

Solution code:
import sys
from collections import deque
from operator import itemgetter

input = sys.stdin.readline

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

Submission status: Accepted

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

def SINGLE_INT(): return int(INPUT())
def MULTIPLE_INT_LIST(): return list(map(int, INPUT().split()))
def MULTIPLE_INT_MAP(): return map(int, INPUT().split())
def SINGLE_STRING(): return INPUT()
def MULTIPLE_STRING(): return INPUT().split()

N = SINGLE_INT()

print(180 * (N-2))

Submission status: Accepted

Solution code:
N = int(input())

ans = (N -2) * 180

print(int(ans))

Submission status: Accepted

Solution code:

n = int(input())

print( (n-2) * 180 )

Submission status: Accepted

Solution code:
# 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_matrix(H):
    '''
    H is number of rows
    '''
    return [list(map(int, read().split())) for _ in range(H)]


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols

    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])

    return ret


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

Submission status: Accepted

Solution code:
N = int(input())

print(N*180-360)

Submission status: Accepted

Solution code:
def inpl():
    return list(map(int, input().split()))


n = int(input())

print(180 * (n - 2))

Submission status: Accepted

Solution code:

import sys
#sys.stdin=open("data.txt")
input=sys.stdin.readline
mii=lambda:map(int,input().split())

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

Submission status: Accepted

Solution code:
from sys import stdin
N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''
#codeforces507A
from collections import Counter
gi = lambda : list(map(int,input().strip().split()))
n, = gi()
print(180*(n-2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import math
import itertools


def makeIntMatrix(lines):
    intMatrix = []
    for a in makeStringMatrix(lines):
        intMatrix.append([int(b) for b in a])
    return intMatrix
 
 
def makeStringMatrix(lines):
    stringMatrix = [line.split() for line in lines]
    return stringMatrix
 
 
def makeInt(line):
    return int(line.rstrip())
 
 
def makeMultiInteger(line):
    return [int(x) for x in line.rstrip().split()]


def solve(input_string):
    a = makeInt(input_string[0])
    return 180 * (a - 2)


def main():
    input_lines = stdin.readlines()
    answer = solve(input_lines)
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()


n = ni()

print(180*(n-2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

x=180*(n-2)

print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def solve(): 
    N = int(input())
    res = 180*(N-2)
    return str(res)

if __name__ == '__main__':
    print(solve())

Submission status: Accepted

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


def solve(N: int):
    ret = 180 * (N - 2)
    print(ret)
    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))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

N = int(input())

print(180*(N-2))

Submission status: Accepted

Solution code:
N = int(input())
print("{:.0f}".format((180 -  360 / N) * N))

Submission status: Accepted

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

X = int(input())

print((X - 2) * 180)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
range = xrange
input = raw_input

n = int(input())

print (n-2)*180

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(180 * (n - 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
"""<https://github.com/cheran-senthil/PyRival>"""
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
else:
    _str = str
    str = lambda x=b"": x if type(x) is bytes else _str(x).encode()


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


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        if self.buffer.tell():
            return self.buffer.read()
        return os.read(self._fd, os.fstat(self._fd).st_size)

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", b" "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", b"\n"))
    if kwargs.pop("flush", False):
        file.flush()


sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
input = lambda: sys.stdin.readline().rstrip(b"\r\n")


def read():
    return input()


def read_array(sep=None, maxsplit=-1):
    return read().split(sep, maxsplit)


def read_int():
    return int(read())


def read_int_array(sep=None, maxsplit=-1):
    return [int(a) for a in read_array(sep, maxsplit)]

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit

import heapq as hq
import itertools as its
import operator as op


# globals
inf = float('inf')
N = 0


def set_inputs():
    global N
    return


def main():
    setrecursionlimit(100000)
    set_inputs()
    # ----------MAIN----------
    n = get_int()
    print(180 * n - 360)
    return


def get_int():
    return int(input())


def get_float():
    return float(input())


def get_str():
    return input().strip()


def get_li():
    return [int(i) for i in input().split()]


def get_lf():
    return [float(f) for f in input().split()]


def get_lc():
    return list(input().strip())


def get_data(n, types, sep=None):
    if len(types) == 1:
        return [types[0](input().strip()) for _ in range(n)]
    return list(zip(*(
        [t(x) for t, x in zip(types, input().strip().split(sep=sep))]
        for _ in range(n)
    )))


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())
Answer = 180*(n-2)
print(Answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import math

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

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

print(A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
#import numpy as np

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

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

print((a-2)*180)

Submission status: Accepted

Solution code:
from heapq import heappush, heappop, heapify, heapreplace

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


if __name__ == '__main__':
    Solution().main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,heapq
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
def ddprint(x):
  if DBG:
    print(x)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

angle = 180 * (n-2)

print(angle)

Submission status: Accepted

Solution code:
N=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("{}".format(180 * (N-2)))

Submission status: Accepted

Solution code:
N = int(input())

print((N-2)*180)

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
Max = sys.maxsize
def l():
	return list(map(int,input().split()))
def m():
	return map(int,input().split())
def s(x):
	a = []
	aa = x[0]
	su = 1
	for i in range(len(x)-1):
		if aa == x[i+1]:
			a.append([aa,su])
			aa = x[i+1]
			su = 1
		else:
			su += 1
	a.append([aa,su])
	return a
def jo(x):
	return " ".join(map(str,x))

n = int(input())

print((n-2)*180)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# m-solutions2019/m_solutions2019_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N = int(input())
print(180 * (N - 2))

Submission status: Accepted

Solution code:
def getN():
    return int(input())

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

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

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

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

N = float(input())

print(int((180.0-360.0/N)*N))

Submission status: Accepted

Solution code:
n = int(input())

print((n-2)*180)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 文字列の入力
s = raw_input()
# 出力
print (int(s)-2)*180

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = 180 * (N-2)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N=INT()

print((N-2)*180)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

res = 180 * (n - 2)

print(res)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


N = int(input())

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

Submission status: Accepted

Solution code:

n = int(input())

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

Submission status: Accepted

Solution code:
l = raw_input().split()
N = int(l[0])
print(180 * (N - 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

base = 180

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
input = sys.stdin.readline
 
# bisect_left(lists, 3)
# bisect_right(lists, 3)

# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

def main():
	#N, K = map(int, input().split(" "))
	N = int(input())
	#S = input()
	#V = input().split(" ")
	#V = [int(s) for s in V]

	tmp = (180 * (N-2) )

	print(tmp)

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

Submission status: Accepted

Solution code:


def main():
    a = int(input())
    # map(int, input().split())
    # data = list(map(int, input().split()))
    print(180 * (a - 2))



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print (180 * (N-2))

Submission status: Accepted

Solution code:
N = [int(i) for i in input().split()][0]

print(180*(N-2))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline

N = int(readline())

print((N - 2) * 180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N] = [int(input_raw[0])]
    print (N - 2) * 180

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/m-solutions2019/tasks/m_solutions2019_a

import itertools
from collections import Counter
from collections import defaultdict
import bisect
from heapq import heappush, heappop

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin

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

input = lambda: stdin.readline()
main()

Submission status: Accepted

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


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


if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = int(input())

print ((N-2)*180)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
K=180*(N-3)+180
print(K)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# from sys import exit
# A, B, C = [int(n) for n in input().split()]
N = int(input())
# a = [int(input()) for _ in range(N)]
# S = str(input())
# L = len(S)
# T = str(input())
# exit()
print((N-2)*180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, math, collections, heapq, itertools
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    while a % b > 0: a, b = b, a % b
    return b
  
def solve():
    file = sys.stdin.readline #single: int(file()), line: map(int, file().split())
    INF = 10 ** 25
    mod = 7 + 10 ** 9
    N = int(file())
    print(180 * (N - 2))
    return 0
  
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())


print(180*(a-2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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))  # type: int
    solve(N)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!venv/bin/python
 
import math
import numpy as np
import random
import copy
import statistics 
import bisect
import heapq
from collections import defaultdict 

#N, K = [ int(x) for x in input().split() ]
#V = [ int(x) for x in input().split() ]

N = int(input())

print((N-2)*180)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    N = int(input())
    print(180*(N-2))

Submission status: Accepted

Solution code:
N = int(input())



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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
from collections import deque
from heapq import heappush,heappop
import re

def int_raw():
    return int(input())
 
def ss_raw():
    return input().split()
 
def ints_raw():
    return tuple(map(int, ss_raw()))


def main():
    N= int_raw()
    return (N-2)*180


print(main())

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# A - Sum of Interior Angles
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((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:
n = int(input())
print(180 + 180 * (n - 3))

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())
ans = int(180 * (n - 2))
print(ans)

Submission status: Accepted

Solution code:
def read():
    N = int(input().strip())
    return N, 


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


if __name__ == '__main__':
    inputs = read()
    print("%d" % solve(*inputs))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return int(input())
from collections import defaultdict

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

Submission status: Accepted

Solution code:
import bisect
from operator import itemgetter
import math
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

Solution code:
#input
a = list(map(int,input().split())) #input from array of integer like "1 2 3"

print(int(180*(a[0]-2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def getlist():
	return map(int, input().split())

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

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=int(input())
# N,K=list(map(int,input().split()))
# inl = [int(input()) for i in range(N)]

print((N-2)*180)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    n = f()[0]
    print((n-2)*180)

solve()

Submission status: Accepted

Solution code:
n = int(input())

print((n-2) * 180)

Submission status: Accepted

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

print(s)

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    N = int(input())

    return 180 * (N - 2)


if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N):
    return 180*(N-2)


def main():
    N = read_int()
    print(slv(N))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())


print(180 * (N - 2))