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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    N=ii()
    print(N**2)




if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
def main():
    import sys
    readline = sys.stdin.buffer.readline

    print(int(readline())**2)

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):
n = int(input())
print(n**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(int(input())**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):
import sys
from io import StringIO
import unittest
import os


sys.setrecursionlimit(999999999)



def resolve():
    try:
        r = int(input())

        print(pow(r, 2))

    except IndexError as err:
        print("インデックスエラー:", err.args[0])



class TestClass(unittest.TestCase):
    def assertIO(self, assert_input, output):
        stdout, sat_in = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, sat_in
        self.assertEqual(out, output)

    def test_input_1(self):
        test_input = """2"""
        output = """4"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """100"""
        output = """10000"""
        self.assertIO(test_input, output)

    
    def test_original(self):
        pass



if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        
        resolve()

    else:
        
        unittest.main(verbosity=2)

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

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

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

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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


if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):


from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


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


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))  
    print(f'{solve(r)}')


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

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

    ans = r ** 2

    print(ans)


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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

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

main()

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

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

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

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

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

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

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

print(n ** 2)

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

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

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

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

Solution (Python):
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy


import heapq
sys.setrecursionlimit(10**6)

INF = 10**18
import bisect
import statistics
mod = 10**9+7


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

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

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

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

Solution (Python):
import math
n = int(input())
print(math.ceil((n * n * math.pi) / (1 * 1 * math.pi)))

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

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

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

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

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

Solution (Python):


r = int(input())

print(r**2)

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

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

Solution (Python):
import math

r = int(input())

pi = int(math.pi)

a = (pi * (r)**2)
ans = a / pi

print(int(ans))

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

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

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

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

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

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

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

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

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

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

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


def main():

    r = int(input())

    ans = r ** 2

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

print(a**2)

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

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

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

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

Solution (Python):



from fractions import gcd
from itertools import combinations,permutations,accumulate 

from collections import deque,defaultdict,Counter
import decimal
import re












import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
print(I()**2)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

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

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

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

Solution (Python):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

a = k()
print(a**2)

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








































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    r = int(lines[0])
    
    
    
    
    
    
    
    
    

    result = r**2

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['2']
        lines_export = [4]
    if pattern == 2:
        lines_input = ['100']
        lines_export = [10000]
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

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

Solution (Python):


import sys
input=sys.stdin.readline

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

Solution (Python):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import product, combinations, permutations
from copy import deepcopy
import sys
import numpy as np
sys.setrecursionlimit(4100000)



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

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

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

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

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

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

print(int((N * N * 3) / 3))

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

print(int(r ** 2))

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

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

if '__main__' == __name__:
    resolve()

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

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

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

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

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

if not ( 1 <= r <= 100 ): sys.exit()

print(r**2)

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

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

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

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

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

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

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

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

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

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

print(r*r)

Solution (Python):
line = int(input())
print(round((line * line * 3.14) / (1 * 1 * 3.14)))

Solution (Python):
import math
line = int(input())
print(round((line * line * 3.14) / (1 * 1 * 3.14)))

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

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

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

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

Solution (Python):


import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)
INF = float("inf")

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

if __name__ == "__main__":
    main()

Solution (Python):
import sys

def cirCle(r: int):
 ans = r ** 2
 print(ans)
 return()


if __name__ == '__main__':
  args = input()
  cirCle(int(args))

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

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

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

    print(r**2)


if __name__ == '__main__':
    main()

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

print(int(radius ** 2))

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

Solution (Python):
import sys




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


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

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

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

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

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

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

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

Solution (Python):

print(int(input())**2)

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

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

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

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

print(r*r)

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    r = int(readline())
    print(r * r)
    
    return


if __name__ == '__main__':
    main()

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

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

ans = int(r ** 2)

print(ans)

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

Solution (Python):


r = int(input())

print(r ** 2)

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

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

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):
if __name__ == "__main__":
    r = int(input())

    
    
    

    print(r*r)

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

Solution (Python):
import os, sys, re, math

r = int(input())

print(r * r)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):


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

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

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

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

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(500005)
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):
a = int(input())
print(int(a**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*r)

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

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

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

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

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):
r=int(input())
a=r*r*3
b=1*1*3
print(int(a/b))

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

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

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

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

print(r*r)

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

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

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


if __name__ == '__main__':
    solve()

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

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

print(r**2)

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

print(r*r)

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

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

print(r * r)

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