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

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

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

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

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


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


if __name__ == "__main__":
    solve()

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

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

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

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

print(r**2)

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

Solution (Python):
import sys
from collections import Counter, deque, defaultdict, OrderedDict
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
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()))

r = INT()
print(r**2)

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

Solution (Python):

import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

Solution (Python):


if __name__ == '__main__':
    r = int(input())

    print(r*r)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


if __name__ == "__main__":
    resolve()

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

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

print(r ** 2)

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


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):
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):
def solve(r):
    return r*r

r = int(input())
print(solve(r))

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


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
def main():
    global visited, adj, sets
    print = out.append
    ''' Cook your dish here! '''
    q = get_int()
    print(q**2)



''' Coded with love at India by Satyam Kumar '''
import sys, threading
from collections import defaultdict
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()

print(*out, sep='\n')

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

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

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

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

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

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

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

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

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


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

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

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

print(n**2)

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

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

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

Solution (Python):
import numpy as np
r = int(input())
c = int(np.pi)*(1**2)
c2 = int(np.pi)*(r**2)
print(int(c2/c))

Solution (Python):
import numpy as np
r = int(input())
c = int(np.pi)*(1**2)
c2 = int(np.pi)*(r**2)
print(int(c2/c))

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

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

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

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

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

ans = r * r
print(ans)

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

if __name__ == '__main__':
    main()

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

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

print(r ** 2)

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

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

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

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

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

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

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

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

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

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

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

print(int(r*r))

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

S = r*r
print(S)

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):
import numpy as np
 
def calucurate_circle(r):
    S = np.pi * r ** 2
    return S
 
def mulitipulicity(r):
    n = r**2
    n = int(n)
    return n

r = float(input())
print(mulitipulicity(r))

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):
import math

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

Solution (Python):


import sys
sys.setrecursionlimit(300000)


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

Solution (Python):
import sys
input = sys.stdin.readline
def print_ans(r):
    """Test Case
    >>> print_ans(2)
    4
    >>> print_ans(100)
    10000
    """
    print(r ** 2)

if __name__ == '__main__':
    r = int(input().rstrip())
    print_ans(r)

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

Solution (Python):

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

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

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

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

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

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

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

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

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

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

print(input_line ** 2)

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

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

print(r**2)

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

Solution (Python):

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






















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

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

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

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

print(i*i)

Solution (Python):
r = int(input())
s = 1
for i in range(2):
  s = s * r
print(s)

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

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

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

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

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

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

print(pow(radius, 2))

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

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

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

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

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

print(i**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(int(r * r))

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

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

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

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

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

if __name__=='__main__':
    main()

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

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

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

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

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

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

print(r*r)

Solution (Python):
n = int(input())
import math
test = 1 * 1 * math.pi
test_ = n * n * math.pi
print(int(round(test_ / test,0)))

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

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

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

Solution (Python):

def main():
    inStr = input()
    try:
        r = int(inStr)
    except Exception as e:
        return

    print(r*r)

main()

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

print(r**2)

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

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

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

print(a*a)

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

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

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

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

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

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

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

Solution (Python):
import numpy as np


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

if __name__ == "__main__":
	main()

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

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

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

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

x = r ** 2 * 3.141592653589793

ans = (x/comparison)

print(round(ans))

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

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

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

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

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

print(r*r)

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

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

r = int(readline())
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*r)

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

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

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

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

print(r*r)

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

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

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

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 math

r = int(input())
p = 1*1*math.pi
rp = r*r*math.pi

ret = rp / p
print(math.ceil(ret))

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

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

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

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

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

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

print(int(r*r))

Solution (Python):

def circle():
    r = int(input())
    ans = r * r / 1
    print(int(ans))

circle()

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

Solution (Python):
input_int = input()

if input_int <= 100 and input_int >= 1:
	print(int(input_int) * int(input_int))

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

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

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

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

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

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

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

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

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

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 = float(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):

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


r = read_a_int()
print(r**2)

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

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

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

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

s = r*r

print(int(s))

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

print(r**2)

Solution (Python):


r = int(input())

area = r*r

times = area/1

print('{:.0f}'.format(times))

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

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

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

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

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

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

Solution (Python):
import numpy

input_line= (input())

default=numpy.square(1)
input_num=numpy.square(int(input_line))

print (int(input_num/default))

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

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

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

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

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

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

print(r**2)

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

print(r**2)

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

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

Solution (Python):
import math

r=int(input())
c=(r**2/3.14)
n=(1**1/3.14)
print(math.floor(c/n))

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(int((r**2)/(1**2)))

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

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

output = N ** 2

print(output)

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

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

Solution (Python):
import sys

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

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

Solution (Python):
import math
r = int(input())
print(math.ceil((math.pow(r,2) * math.pi) / (1 * math.pi)))

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

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

Solution (Python):


a = int(input())
out = a**2

print(int(out))

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

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

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

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

Solution (Python):
import sys


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


if __name__ == '__main__':
    main()

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

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

print(r*r)

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

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def solve():
    n = II()
    print(n**2)
    return



if __name__ == '__main__':
    solve()

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):
if __name__=='__main__':
    r = int(input())
    print("{}".format(r*r))

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

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

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

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

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

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

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

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

ans= r**2

print(ans)

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

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

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

def main(r):
    return r*r

print(main(r))

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

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

print(r ** 2)

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

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

print(r ** 2)

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

Solution (Python):
from sys import stdin


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=ii()
print(n*n)

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

d = int(r * r)

print(d)

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

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

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

print(r**2)

Solution (Python):

import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def fi(): return float(input())
def mfi(): return map(float, input().rstrip().split())
def lmfi(): return list(map(float, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(*args, sep=" ", end="\n"): print("debug:", *args, file=sys.stderr, sep=sep, end=end) if not __debug__ else None
def exit(*arg): print(*arg); sys.exit()



def main():
    r = ii()
    print(r * r)
    return


if __name__ == '__main__':
    main()

Solution (Python):

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

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

print(int(r_x**2))

Solution (Python):




r = int(input())

S = r * r

print(S)

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

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

print(r * r)

Solution (Python):
import sys

input = sys.stdin.readline

R = int(input())

print(int(R ** 2))

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

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

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

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


def solve():
    return r * r


print(solve())

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

print(r**2)

Solution (Python):
from sys import stdin


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)

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


if __name__ == '__main__':
    a()

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

Solution (Python):
import math

pi = math.pi
circle1 = 1 ** 2

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

answer = int(circle2 / circle1)
print(answer)

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

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

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

Solution (Python):
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time

def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
ts=time.time()
sys.setrecursionlimit(10**6)

show_flg=False
show_flg=True

ans=0
n=I()
print(n**2)

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

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

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

print(int(r**2))

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

print(circle)

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

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

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

print (r ** 2)

Solution (Python):
from sys import stdin


def ii(): return int(stdin.readline())

def mi(): return map(int, stdin.readline().split())

def li(): return [x for x in mi()]

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

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

ans = a * a

print(ans)

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

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

Solution (Python):
radius = int(input())
result = radius**2
print(int(result))