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

Solution (Python):
import sys

input = sys.stdin.readline

ri = lambda: int(input())
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

r = ri()
print(r**2)

Solution (Python):

import sys


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



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))  
    solve(r)

if __name__ == '__main__':
    main()

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    r = II()
    print(r*r)

if __name__ == '__main__':
    main()

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

Solution (Python):
r=int(input())

print(r*r)

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

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

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

Solution (Python):
import math
import sys
input = sys.stdin.readline


def main():
    sc = Scan()
    a = sc.intarr()[0]
    print(a**2)


class Scan():

    def intarr(self):
        line = input()
        array = line.split(' ')
        num_array = [int(n) for n in array]
        return num_array

    def strarr(self):
        line = input()
        array = line.split(' ')
        array[-1] = array[-1].strip('\n')
        return array


main()

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

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

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

Solution (Python):
n = int(input())

print(int(n*n))

Solution (Python):
r = int(input())

print(r*r)

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

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

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

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

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

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

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

Solution (Python):
r = int(input())

print(r ** 2)

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

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

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

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

Solution (Python):


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

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

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce
sys.setrecursionlimit(10 ** 9)



INF = 10 ** 20
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7



print(I() ** 2)

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
r = int(input())

print(int(r**2))

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

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

Solution (Python):
n = int(input())

print(n**2)

Solution (Python):
r = int(input())

print(r ** 2)

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

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

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

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

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

Solution (Python):


import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def MI() : return map(int, input().split())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

r =I()

print(r * r)

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

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

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

Solution (Python):
print(int(int(input().strip())**2))

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

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

Solution (Python):
r = int(raw_input())
print r * r

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline

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

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

Solution (Python):

r = int(input())

print (r ** 2)

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

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

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

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

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

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

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

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

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

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

Solution (Python):

import sys, math
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans=count=0

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())

print(n*n)

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

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

Solution (Python):


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

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

Solution (Python):
import sys
from heapq import heapify, heappop, heappush
MAX_INT = int(10e15)
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()

r = I()
print(r**2)

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):



r=int(input())

print(r**2)

Solution (Python):
from fractions import gcd
from datetime import date, timedelta
from heapq import*
import math
from collections import defaultdict, Counter, deque
import sys
from bisect import *
import itertools
import copy
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7




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



            
            
            
            
            
        


if __name__ == '__main__':
    main()

Solution (Python):
x = int(raw_input())
print x * x

Solution (Python):
r = int(input())

print(r * r)

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

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

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

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

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
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
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(int(input())**2)
if __name__ == '__main__':
    main()

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

Solution (Python):
n = int(input())

print(n*n)

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

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

r = ni()
print(r*r)

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
INF=10**18
def input():
    return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

Solution (Python):
def main():
    n = input()
    print n * n


if __name__ == "__main__":
    main()

Solution (Python):
r = int(input())

print(r**2)

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

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

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

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

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

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

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

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

Solution (Python):


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

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

Solution (Python):
r = int(input())

print(r*r)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n = I()

    return n**2


print(main())

Solution (Python):
a = int(input())

print(a**2)

Solution (Python):






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

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

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
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))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

n = onem()

print(n**2)

Solution (Python):



import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
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()))

r = I()
print(r**2)

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

Solution (Python):
from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7

def inp(): 
    return int(input())
def inpm(): 
    return map(int,input().split())
def inpl(): 
    return list(map(int, input().split()))
def inpls(): 
    return list(input().split())
def inplm(n): 
    return list(int(input()) for _ in range(n))
def inpll(n): 
    return sorted([list(map(int, input().split())) for _ in range(n)])
def sortx(x,n,k):
    if k == 0:x.sort(key=lambda y:y[1,n])
    else:x.sort(reversed=True, key=lambda y:y[1,n])
def graph():
    n=inp()
    g=[[] for _ in range(n)]
    for i in range(n):
        a=inp()
        a-=1
        g[i].append(a)
        g[a].append(i)
    return n,g
def graphm():
    n,m=inpm()
    g=[[] for _ in range(n)]
    for _ in range(m):
        a,b,w=inpm()
        a-=1
        b-=1
        g[a].append((b,w))
        g[b].append((a,w))
    return n,m,g

def dijkstra(s,n,g): 
    s -= 1
    que = []
    d = [10**15 for _ in range(n)]
    d[s] = 0
    heappush( que,(0,s) )
    while len(que)>0:
        p =  heappop(que)
        v = p[1]
        if d[v] < p[0]:
            continue
        for i in range(len(g[v])):
            edge = g[v][i]
            if d[edge[0]] > d[v] + edge[1]:
                d[edge[0]] = d[v] + edge[1]
                heappush( que,(d[edge[0]] , edge[0]) )
    return d

def main():
    r=inp()
    print(r**2)

      
      

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin
import statistics
from math import factorial

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

print(n**2)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

r = INT()

print(r*r)

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

Solution (Python):
r = int(input())

print(r**2)

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

Solution (Python):
n = int(input())

print(n**2)

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

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

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

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

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

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

Solution (Python):

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

Solution (Python):
r = int(input())

print(r**2)

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

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

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

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

Solution (Python):
r = int(input())

print(r**2)

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

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

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

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

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

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

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

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

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

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

Solution (Python):
r = int(input())

print(r * r)

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


if __name__ == '__main__':
    main()

Solution (Python):
r = int(input())

print(r ** 2)

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

Solution (Python):
r = int(input())

print(r*r)

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

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

Solution (Python):
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7

r = int(sys.stdin.readline())
print(int(r**2))

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

Solution (Python):

import sys
input = sys.stdin.buffer.readline


from collections import defaultdict


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


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


if __name__ == '__main__':
	main()

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

Solution (Python):


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

Solution (Python):
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
sys.setrecursionlimit(10 ** 7)

def main():
  n = ni()
  print(n**2)

if __name__ == '__main__':
  main()

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

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

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

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

Solution (Python):

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

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    r = I()
    print(r**2)
    return


if __name__ == "__main__":
    solve()

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))



r = I()
print(r**2)

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

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

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

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

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

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

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

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

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