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



def ri():
    return int(input())

def rl():
    return list(input().split())

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

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


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

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

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

Solution (Python):

n = int(input())

print(n**2)

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

Solution (Python):
from sys import stdin


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

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

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

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

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

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

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

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):

import sys
import math
input = sys.stdin.readline


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

Solution (Python):
s=list(map(int,input().split()))
print(s[0]*s[0])

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10000000)


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

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

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

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

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

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

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

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

Solution (Python):



import math


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


def main():

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




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

Solution (Python):
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

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

Solution (Python):
from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math

print(int(stdin.readline().rstrip())**2)

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

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

Solution (Python):

import sys
import math
import numpy as np
import itertools


n = int(input())

print(n*n)

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30

def main():
    n = int(input().strip())
    print(n**2)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):

x = int(input())

ans = x * x

print(ans)

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

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

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

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

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

print(n**2)

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

print(a*a)

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

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

main()

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

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

Solution (Python):
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res



def A():
    r = I()
    print(r * r)
    return



def B():
    return



def C():
    return



def D():
    return



def E():
    return



def F():
    return



def resolve():
    A()
    return



if __name__ == "__main__":
    A()

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

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

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

Solution (Python):


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

if __name__ == "__main__":
    main()

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

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

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

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

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

print (r**2)

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

Solution (Python):
a = input()

a = int(a)

print(a*a)

Solution (Python):
import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from copy import deepcopy




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

if __name__ == '__main__':
    main()

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

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

S = r ** 2

print(int(S))

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

ans = r*r

print(ans)

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

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



if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
input=lambda :sys.stdin.readline().rstrip()
inputs= sys.stdin.buffer.readlines
INF=float("inf")
MOD=10**9+7
























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



if __name__ == '__main__':
	main()

Solution (Python):


import os
import sys


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




DEBUG = 'DEBUG' in os.environ


def inp():
    return sys.stdin.readline().rstrip()


def read_int():
    return int(inp())


def read_ints():
    return [int(e) for e in inp().split()]


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


if __name__ == '__main__':
    main()

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

ii = lambda: int(input())
mis = lambda: map(int,input().split())
lmis = lambda: list(mis())
INF = float('inf')

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

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

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

Solution (Python):



def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)

    

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

print(r**2)

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


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


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

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

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

r = int(input())


print(r**2)

Solution (Python):
import bisect

mod = 1000000007

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


if __name__=='__main__':
    main()

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

import sys
input = sys.stdin.readline

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

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

Solution (Python):



import sys


input = sys.stdin.readline


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

if __name__ == '__main__':
    main()

Solution (Python):



r = int(input())

answer = r*r

print(answer)

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

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

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

print(R * R)

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

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

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

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
input = sys.stdin.readline

import numpy as np

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

    print(n**2)


if __name__ == '__main__':
    main()

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

Solution (Python):
from sys import stdin
input = int(stdin.readline().rstrip())
print(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):
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*n)

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

Solution (Python):


def readInts():
  return [int(s) for s in input().split(" ")]

def main():
  r = readInts()[0]
  print(r * r)

if __name__ == "__main__":
  main()

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):

from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re
import heapq


from copy import deepcopy
import itertools

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))






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





main()

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

input = sys.stdin.readline

N = int(input())

print(N**2)

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

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

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

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

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

print(N**2)

Solution (Python):
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]






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

Solution (Python):
from sys import stdin


def input():
    return stdin.readline()[:-1]


def intput():
    return int(input())


def sinput():
    return input().split()


def intsput():
    return map(int, sinput())


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

ans = r ** 2
print(ans)

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

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

Solution (Python):
def main():

    r = int(input())
    return r * r

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

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

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

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

print(r**2)

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

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

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

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

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

Solution (Python):

import sys


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



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

if __name__ == '__main__':
    main()

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

print(r**2)

Solution (Python):
import sys; readline = sys.stdin.readline
from collections import deque

r = int(readline())
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):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    r=int(input())
    print(r*r)
resolve()

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

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

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

Solution (Python):
import numpy as np

n = int(input())

print(int(n * n))

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

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

s = r*r
print(s)

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    r = int(readline())
    print(r ** 2)


if __name__ == '__main__':
    solve()

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

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

Solution (Python):

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

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

print(r * r)

Solution (Python):
def examA():
    N = I()
    ans = N*N
    print(ans)

def examB():
    N = I()


import sys,copy,bisect,itertools
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

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

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

print(r*r)

Solution (Python):






S = int(input())




print(int(S * S))

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

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

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



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

r = int(sys.stdin.readline())


print(r*r)

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

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

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

r = ni()
print(r*r)

Solution (Python):
import math
import copy
import sys
import fractions
import numpy as np
from functools import reduce
import statistics




def getInputInt():
    inputNum = int(input())
    return inputNum


def getInputListInt():
    outputoData = []
    inputData = input().split()
    outputData = [int(n) for n in inputData]

    return outputData


def getSomeInputInt(n):
    outputDataList = []
    for i in range(n):
        inputData = int(input())
        outputDataList.append(inputData)

    return outputDataList


def getSomeInputListInt(n):
    inputDataList = []
    outputDataList = []
    for i in range(n):
        inputData = input().split()
        inputDataList = [int(n) for n in inputData]
        outputDataList.append(inputDataList)

    return outputDataList




n = getInputInt()

ans = n*n

print(ans)

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

print(n**2)

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

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    r = int(inputs[0])
    return r * r


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

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

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

Solution (Python):




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


if __name__ == '__main__':
  main()

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

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

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

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  r=I()
  return r*r


print(main())

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

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

print(n**2)

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

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

print(r**2)

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

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


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    r = int(readline())
    print(r ** 2)


if __name__ == '__main__':
    solve()

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

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(R):
    return R**2


def main():
    R = read_int()
    print(slv(R))


if __name__ == '__main__':
    main()

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

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

print(r*r)

Solution (Python):
import numpy as np

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

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

Solution (Python):
r, = (int(x) for x in input().split())

print(r*r)

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

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

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