Problem:


Score : 100 points

Problem Statement

Given is an integer r.

How many times is the area of a circle of radius r larger than the area of a circle of radius 1?

It can be proved that the answer is always an integer under the constraints given.

Constraints

1 \leq r \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

r

Output

Print the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.

Sample Input 1

2

Sample Output 1

4

The area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.

Note that output must be an integer - for example, 4.0 will not be accepted.

Sample Input 2

100

Sample Output 2

10000



Sample input:
2


Sample output:
4

Submission status: Accepted

Solution code:
def main():
  r = int(input())
  print(r * r)

main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    radius = int(input())
    print(radius ** 2)

Submission status: Accepted

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

Submission status: Accepted

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

print(R**2)

Submission status: Accepted

Solution code:
"""from sys import stdin
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return [x for x in mi()]
def si(): return stdin.readline()
"""
n=int(input())
print(n*n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    r = int(args[0])
    return str(r**2)


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
def solve():
  r = int(input())
  print(r**2)
solve()

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
from collections import defaultdict
from heapq import heappop, heappush
import itertools
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を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	r = inputInt()

	a = r*r
	print(a)



if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
print input()**2

Submission status: Accepted

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

r = int(input().strip())
print(r*r)

Submission status: Accepted

Solution code:
def circle(r):
    return r * r


if __name__ == "__main__":
    r = int(input())
    print(circle(r))

Submission status: Accepted

Solution code:
R = input()
print( int(int(R) ** 2))

Submission status: Accepted

Solution code:
r=int(input())
ans=int((r**2)/1)
print(ans)

Submission status: Accepted

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


def solve(r: int):
    print(int(r**2))


# 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()
    r = int(next(tokens))  # type: int
    solve(r)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

import math

# 入力
# 整数の入力
r = int(input())

print (r*r)

Submission status: Accepted

Solution code:
import math

r = input()
#piはキャンセルされる

print(int(r)*int(r))

Submission status: Accepted

Solution code:
r = int(open(0).read())
print(r**2)

Submission status: Accepted

Solution code:
R = int(input())
print(R*R)

Submission status: Accepted

Solution code:
r = int(raw_input())

print int(r**2)

Submission status: Accepted

Solution code:
def A():
    print(int(input())**2)

A()

Submission status: Accepted

Solution code:
r = int(input())
ans = r*r
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=int(input())
print(s*s)

Submission status: Accepted

Solution code:

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline 

n = int(input())

print(n*n)
"""
#a = [int(i) for i in readline().split()]
x,y = [int(i) for i in readline().split()]


xx = x-2*y
yy = (-2)*x+y

ng = 0

if xx%3 != 0: ng = 1
if yy%3 != 0: ng = 1

xx //= 3 
yy //= 3
xx *= -1
yy *= -1

#print(ng,xx,yy)

if ng: print(0)
else: print(choose(xx+yy,xx)%MOD)







"""

Submission status: Accepted

Solution code:
r = int(input())

print(pow(r, 2))

Submission status: Accepted

Solution code:
x = int (input ())

import math
a1 = 2 * math.acos (-1)
a2 = 2 * math.acos (-1) * x


print (int (x ** 2))

Submission status: Accepted

Solution code:
class Solution:
    def solve(self, r: int) -> int:

        return r**2


if __name__ == '__main__':

    # standard input
    r = int(input())

    # solve
    solution = Solution()
    print(solution.solve(r))

Submission status: Accepted

Solution code:
r = int(input())

ans = r*r

print(ans)

Submission status: Accepted

Solution code:
import sys

r = int(input())
res = r * r / 1
print(int(res))

Submission status: Accepted

Solution code:

r = int(input())

s = r ** 2

print(s)

Submission status: Accepted

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

# input
r = int(input())

# solve & output
print(int(r ** 2))

Submission status: Accepted

Solution code:
r = int(input())

x = r ** 2

print(x)

Submission status: Accepted

Solution code:
r = int(input())
print(r**2 // 1)

Submission status: Accepted

Solution code:
r = int(input())

menseki = r*r

print(menseki)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# get a integer
a = int(raw_input())

print(str(a**2))

Submission status: Accepted

Solution code:
import sys,queue,copy,math
sys.setrecursionlimit(10**8)
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
INF = float('inf')

r = int(input())

ans = (r*r)/(1*1)
print(int(ans))

Submission status: Accepted

Solution code:
r = int(input(''))
print (r ** 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import logging

logging.basicConfig(level=logging.INFO, format="%(message)s")
#logging.disable(logging.CRITICAL)

def main():
    r = int(input())
    logging.info("Hello!")

    print(r * r)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import stdin


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

    print(r*r)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
R = int(input())
print(R ** 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(int(N * N))

Submission status: Accepted

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

r=SORO_INT()
print(r**2)

Submission status: Accepted

Solution code:
r = int(input())
o = r*r
print(o)

Submission status: Accepted

Solution code:
r=int(input().strip())
print(int(r*r))

Submission status: Accepted

Solution code:
'''  Hariom_Pandey
      16.11.2019   '''

import math as mt
import sys as sy

A=int(input())
print(A**2)

Submission status: Accepted

Solution code:
def abc145_a():    
    r = int(input())
    ans = r**2
    print(ans)
    
if __name__ == '__main__':
    abc145_a()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

    r = int(input())

    print(int(r * r))


main()

Submission status: Accepted

Solution code:
r = int(input())
pi = r * r
print(pi)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#入力
r = int(input())

#計算
rsq = r*r

#出力
print(rsq)

Submission status: Accepted

Solution code:
import math


def main():
    r = int(input())
    pi = math.pi

    print(int(math.ceil(r**2*pi) / (1**2*pi)))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
r = int(input())
Answer = int(r*r)
print(Answer)

Submission status: Accepted

Solution code:
import sys
n = int(sys.stdin.readline())
print(n*n)

Submission status: Accepted

Solution code:
input_num = int(input())

print(input_num * input_num)

Submission status: Accepted

Solution code:
r = int(input())
r2 = r * r
print(r2)

Submission status: Accepted

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

from collections import deque, defaultdict
import itertools as ite
import sys
import math
import decimal

sys.setrecursionlimit(1000000)

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

n = input()
print n * n

Submission status: Accepted

Solution code:
r = int(input())

# r = 2

print(r * r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
 
r1 = 1
 
print(int(r**2))

Submission status: Accepted

Solution code:

r = int(input())
s = r * r
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    # map(int, input().split())
    # l = list(map(int, input().split()))
    r = int(input())
    print(r*r)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

    print(int(r ** 2))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
r = int(input())

x = r ** 2
print(x)

Submission status: Accepted

Solution code:
def getCircleArea(r):
    return r * r


print(getCircleArea(int(input())))

Submission status: Accepted

Solution code:
import sys

def solve(r):
    print(r**2)

if __name__ == '__main__':
    r = int(sys.stdin.readline().strip())
    solve(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

s = r**2

print(s)

Submission status: Accepted

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

r = int(input())

print(r * r)

Submission status: Accepted

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

def _i(): return int(sys.stdin.readline().strip())

print(_i()**2)

Submission status: Accepted

Solution code:
obj = input()
r = int(obj.strip())
print(r * r)

Submission status: Accepted

Solution code:
#191116 A
if __name__ == "__main__":
    r = int(input())
    print(r*r)

Submission status: Accepted

Solution code:
import sys

for line in sys.stdin:
    r = int(line.rstrip())
    print(r*r)

Submission status: Accepted

Solution code:
import sys
R = int(input())
print(R * R)

Submission status: Accepted

Solution code:
N = int(input())

print(N*N//1)

Submission status: Accepted

Solution code:
def main():
    r = int(input())
    print(r * r)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!python3.4.3

r = int(input())
r = r**2

print(r)

Submission status: Accepted

Solution code:
r = int(input()) 

print(r**2)

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    R = int(input())
    print(R * R)


main()

Submission status: Accepted

Solution code:
import sys


def answer():
    input = sys.stdin.readline
    r = int(input())
    s = r **2

    print(s)


if __name__ == '__main__':
    answer()

Submission status: Accepted

Solution code:

input = int(input())
print(input * input)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
print(x*x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def c(a):
    return a*a
a=int(input())
print(c(a))

Submission status: Accepted

Solution code:
r=int(input())
print( r*r )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")

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

main()

Submission status: Accepted

Solution code:
r = int(input())
print(r*r)

Submission status: Accepted

Solution code:
r = int(input())

r = r**2

print(r)

Submission status: Accepted

Solution code:
i=int(input())
print(i*i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())
print(l**2)

Submission status: Accepted

Solution code:
import subprocess
import os
import time


import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)

# input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# ABC145A

r = int(input())

print(r**2)

Submission status: Accepted

Solution code:
import math
r = int(input())
ans = r ** 2
print(ans)

Submission status: Accepted

Solution code:
r = int(input())
print(r * r)

Submission status: Accepted

Solution code:
def solve(r):
    return r * r


def main():
    r = int(input())
    res = solve(r)
    print(res)


def test():
    assert solve(2) == 4
    assert solve(100) == 10000


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

r = int(input())

print(r*r)

Submission status: Accepted

Solution code:
r = int(input())

s1 = 1

print(int((r*r)/1))

Submission status: Accepted

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

Submission status: Accepted

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

r = int(input().split()[0])

a = 1 * 1
b = r * r

ans = b // a

print(ans)

Submission status: Accepted

Solution code:
import math
r = int(input())
print(r**2)

Submission status: Accepted

Solution code:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]

    r = int(input())
    print(r**2)




if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
num = int(input())
print(num**2)

Submission status: Accepted

Solution code:
import numpy as np
a = list(map(int,input().split()))

r = a[0]

ans = r**2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

r = int(input())

print(r**2)

Submission status: Accepted

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

print(r*r)

Submission status: Accepted

Solution code:
r = int(input())
print(int(r*r*3//3))

Submission status: Accepted

Solution code:
r = int(input())
answer = r ** 2
print(answer)

Submission status: Accepted

Solution code:
n=int(input())
ans=(n*n)//1
print(ans)

Submission status: Accepted

Solution code:
r = int(input())
moto = 1*1*3
menseki = r*r*3
print(int(menseki/moto))

Submission status: Accepted

Solution code:
import math
r=int(input())
print(r*r)

Submission status: Accepted

Solution code:
import os
import numpy as np

class getStdin(object):
    @classmethod
    def get_int(cls):
        return int(input())

    @classmethod
    def get_ss_int(cls):
        return list(map(int, input().split()))

    @classmethod
    def get_na_int(cls):
        return np.array(list(map(int, input().split())))


if __name__ == '__main__':
    n = getStdin.get_int()
    print(n**2)
    os.sys.exit(0)

Submission status: Accepted

Solution code:
import sys
import math
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

r = ni()

print(r**2)

Submission status: Accepted

Solution code:
n = input()
m = int(n)
a = m * m
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC145 A
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
r = ni()
print(r**2)

Submission status: Accepted

Solution code:
def main():
    r = int(input())
    print(r**2)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

    print(radius ** 2)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

res = r * r

print(res)

Submission status: Accepted

Solution code:
r = int(input())
ans = r ** 2

print(str(ans))

Submission status: Accepted

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

r = int(input())
ans = r**2
print(ans)

Submission status: Accepted

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

_r = int(input())


def chker(r):
    print(int(r ** 2))


chker(_r)

Submission status: Accepted

Solution code:
num = int(input())
print(num**(2))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
print("{}".format(a**2))

Submission status: Accepted

Solution code:
##145
##A
r = int(input())
print(r*r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
print(str(r**2))

Submission status: Accepted

Solution code:
r = int(input())
circle = 1
print(r**2//circle)

Submission status: Accepted

Solution code:
r = int(input())
ans = r ** 2 // 1
print(ans)

Submission status: Accepted

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

#input
r = int(input())

#output
print(r**2//1)

Submission status: Accepted

Solution code:
r = int(input())
print(str(r * r))

Submission status: Accepted

Solution code:
import math
print(int(input())**2)

Submission status: Accepted

Solution code:
r = int(input())

ans = r ** 2
print(ans)

Submission status: Accepted

Solution code:
r = int(input())

print(int(r * r ))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(int(1e6))

r = int(input())

ans = r * r

print(ans)