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
sys.setrecursionlimit(1000000000)
from itertools import count
from functools import lru_cache
from collections import defaultdict
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok



def main():
    print(ii()**2)


main()

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

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

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

Solution (Python):
r = int(input())
print(int(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):
r = int(input())
r *= r

print(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):
def circle():
  r = int(input())

  return print('{}'.format(r**2))

circle()

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

Solution (Python):
from sys import stdin

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

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

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

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

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

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

    print(r**2)


if __name__ == '__main__':
    main()

Solution (Python):

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

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

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

Solution (Python):
x = input()
y = 2

print(int(x) ** y)

Solution (Python):
x = input()

sum = int(x) * int(x)
print(sum)

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

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

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

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

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

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

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

print(s*s)

Solution (Python):
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac
import fractions
from functools import reduce
from operator import mul
import bisect
import sys
import logging
import heapq
import itertools

logging.basicConfig(level=logging.ERROR)

input = sys.stdin.readline

setrecursionlimit(1000000)


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

def factorization(n):
	if n<2:
		return []

	arr = []
	temp = n
	for i in range(2, int(-(-n**0.5//1))+1):
		if temp%i==0:
			cnt=0
			while temp%i==0:
				cnt+=1
				temp //= i
			arr.append([i, cnt])

	if temp!=1:
		arr.append([temp, 1])

	if arr==[]:
		arr.append([n, 1])

	return arr

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(numbers):
	return reduce(fractions.gcd, numbers)

def lcm(numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

class Queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class Stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

class PriorityQueue():
	def __init__(self):
		self.queue = []
	def push(self,i):
		heapq.heappush(self.queue,-i)
	def pop(self):
		return -1 * heapq.heappop(self.queue)
	def sum(self):
		return -sum(self.queue)

main()

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

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

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

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

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

print(r*r)

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

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

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

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

Solution (Python):
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*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):
r = int(input())
print(r**2)

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

Solution (Python):
r = int(input())
ans = r*r
print("{}".format(ans))

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

Solution (Python):
r = input()

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

Solution (Python):
print(int(input())**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):
r = int(input())
print(r*r)

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

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

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

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

Solution (Python):
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*r)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys

for line in sys.stdin:
    print(int(line) ** 2)

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

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

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

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

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

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

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

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

Solution (Python):


from math import pi

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

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

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

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

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

Solution (Python):

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

Solution (Python):
print(int(input())**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):
print(int(input()) ** 2)

Solution (Python):
if __name__ == '__main__':
	n = int(input())

	print(n*n)

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(pow(r,2))

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

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

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

main()

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

r = ni()

print(r**2)

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

Solution (Python):
r = int(input())
print(str(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):
a = int(input())
print(a*a)

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

ans = r * r
print(ans)

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

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

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

ans = r**2

print(ans)

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

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

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

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

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

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

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

Solution (Python):
r = input()
print (int(r)*int(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):
print(int(input())**2)

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

print(r**2)

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

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

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

print(a**2)

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    return


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


if __name__ == '__main__':
    main()

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

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

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

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

Sr = r * r
S1 = 1 * 1
ans = Sr / S1

print(int(ans))

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

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

a_1=r**2
print(a_1)

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

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

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

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

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

ans = r ** 2

print(ans)

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

print(r ** 2)

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

print(r ** 2)

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

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

print(r ** 2)

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

one_area = 1
area = a * a

print(int(area / one_area))

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

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

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

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

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

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

Solution (Python):
r = int(input())
if int(r):
    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):
r = int(input())
print(r*r)

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

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

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

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

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

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

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

men_r = r*r



print(men_r)

Solution (Python):


import math









r = int(input())

print(r**2)

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

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

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

Solution (Python):
import math

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

    base_s = math.pi

    ans = s/base_s

    print(round(ans))

if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
print(int(input())**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):
r = int(input())
ans = r * r
print(ans)

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

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

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

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

Solution (Python):
r=int(input())
print('{:.0f}'.format(r*r))

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

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

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

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

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

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

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

Solution (Python):
def main(i):
  return print(i**2)

if __name__=="__main__":
  i=int(input())
  main(i)

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

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

n = r * r

print n

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

Solution (Python):

r = int(raw_input())

print str(r*r)

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

Solution (Python):
def f(n):
    print(n * n)


if __name__ == '__main__':
    n = int(input())
    f(n)

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

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

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

print(r**2)

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

print(r**2)

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

print(r**2)

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

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

print(r ** 2)

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

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

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

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

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

Solution (Python):
print(int(input().strip())**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):
r = int(input())

ans = r**2

print(ans)

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

print(r**2)

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

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

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

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

print(r*r)

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

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

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

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

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

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

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

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

Solution (Python):

import sys
INF = float("inf")


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


print(r ** 2)

Solution (Python):

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

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

print(num*num)

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

print(a)

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

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

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

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

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

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

Solution (Python):

r = int(input())

r2 = int(r**2)

print(r2)

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

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

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

Solution (Python):
circle_r_text = input()
circle_r = int(circle_r_text)

circle_area = circle_r ** 2;
print(circle_area)

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

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

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

print(r*r)

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

Solution (Python):
import math
x = int(input())
print ('{0}'.format(x**2))

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

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

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

print (n*n)

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

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

Solution (Python):
input_x = input()
x = int(input_x)

compared = x*x

print(str(compared))

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

print(r**2)

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

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

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

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

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

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

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

print(int(r*r))

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

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

print(s*s)

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
MOD = 1000000007
def POW(x, y): return pow(x, y, MOD)
def INV(x, m=MOD): return pow(x, m - 2, m)
def DIV(x, y, m=MOD): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())


a=II()
print(a*a)

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

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

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

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

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

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

Solution (Python):

print(pow(int(input()),2))

Solution (Python):
n = int(input())
print(int(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*R)

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

print(r*r)

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

print(r**2)

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

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

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


main()

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

Solution (Python):
s = input ()

def radius(r):
  to_number = int(r)
  return to_number ** 2

print (radius(s))

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

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

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

Solution (Python):
r= int(input())
if (1<=r and r<=100):
 print(r*r)

Solution (Python):
import sys

r      = input()
intr   = int(r)
floatr = float(r)

if intr < 1 or intr > 100:
    print( "ERROR:input value is wrong!")
    exit() 

print( int( floatr**2e0 ) )

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

Solution (Python):
b = int(input())
c = b*b
print(c)

Solution (Python):
b = int(input())
c = b*b
print(c)

Solution (Python):
b = int(input())
c = b*b
print(c)

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

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

print(N*N)

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

print(N*N)

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

Solution (Python):



def rint():
    return int(input())


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


print(rint()**2)

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

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

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

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

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

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

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

Solution (Python):
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*r)

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

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

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

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())
ans = r * r
print(ans)

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

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

print(int(r*r))

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

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

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

b = r * r

print(b)

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

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

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

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

print(r*r)

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

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(pow(r,2))

Solution (Python):
import math

def circle(r):
    return r*r

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
print(int(input())**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(int(r**2))

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

main()

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

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

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

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

Solution (Python):
print(int((pow(int(input()), 2))))

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

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

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

print(a*a)

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

print(r * r)

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

print(str(n*n))

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 io

def main():
    s = input()

    basic = 1 * 1

    enter = int(s) * int(s)

    print (enter)


if __name__ == '__main__':
	main()

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

print(r*r)

Solution (Python):
n=int(input())
if n<=100:
    print(int(n**2//1))

Solution (Python):
r = int(input())
print(r**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*r)

Solution (Python):
from sys import stdin
r = int(stdin.readline().rstrip())
print(r**2)

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

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

print(r ** 2)

Solution (Python):
def main():
    n = iread()
    print(n ** 2)

def iread():
    return int(input())


def sread():
    return input()


def aread(t="int"):
    if t == "int":
        ret = [int(i) for i in input().split()]
    elif t == "str":
        ret = list(input().split())
    return ret


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


if __name__ == '__main__':
    main()

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):
import copy
import heapq

def j(n):
    if n:print("Yes")
    else:print("No")
    exit(0)
rem = 10 ** 9 + 7

"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def ipmultiplerow(n):
    a = []
    for i in range(n):
        a.append(ip())
    return a
def printrow(a):
    for i in a:
        print(i)

print(ip()**2)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(1000000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in sys.stdin.readline().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v

def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False



dp = None


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


main()

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


print(r*r)