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 main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    r = r_int()
    print(r*r)

    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

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

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

print(r*r)

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

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

Solution (Python):
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())

sys.setrecursionlimit(10 ** 9)


def main():
    R = INT()
    print(R*R)


if __name__ == '__main__':
    main()

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

S = r ** 2
S_1 = 1
print(int(S / S_1))

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

print(int(r ** 2))

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

print(n*n)

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

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


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

Solution (Python):
def read():
    r = int(input().strip())
    return r,

def solve(r):
    return r ** 2

if __name__ == '__main__':
    inputs = read()
    print("%d" % solve(*inputs))

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

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

print(r*r)

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

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

if  __name__=='__main__':
    main()

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

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

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

print(n**2)

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

ans=r*r

print(ans)

Solution (Python):


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

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


class AtCoder:
    def main(self):
        r = int(input())

        print(r*r)



if __name__ == '__main__':
    AtCoder().main()

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

Solution (Python):


n=int(input())  

print(n*n)

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

Solution (Python):
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import 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)]


def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)


def my_index_multi(l, x):
    return [i for i, _x in enumerate(l) if _x == x]


def sosu(x):
    for i in range(2, int(sqrt(x)+1)):
        if x % i == 0:
            return False
    return True


mod = 1000000007
inf = float('INF')


def A():
    r = II()

    print(r*r)




def B():
    N = II()
    D = LI()
    if D[0] != 0:
        print(0)
        return

    if D.count(0) != 1:
        print(0)
        return
    ans = [0]*(N)
    answer = 1

    for i in range(1, N):

        ans[D[i]] += 1
    count = ans[1]
    for x in range(1, N-2):
        a = ans[x]
        b = ans[x+1]
        if a == 0:
            print(0)
            return
        answer = answer * (a**b)
        count += b
        if count == N-1:
            break

    print(answer)

    return




def C():
    N = II()
    A = LI()
    B = LI()

    L = []
    count = 0
    for i in range(2, int(sqrt(N)+2)):
        if N % i == 0:
            L.append(N/i)
            count = 1
    if count == 0:
        print(N-1)
    else:
        print(int(L[-1]-2+(N/L[-1])))

    return




def D():

    a, b, x = LI()
    BIG = a*a*b/2
    if x > BIG:
        y = 2*b-(2*x/a/a)
        print(math.degrees(math.atan(y/a)))
    else:
        y = 2*x/a/b
        print(math.degrees(math.atan(b/y)))
    return




def E():
    N, K = LI()
    A = LI()
    F = LI()
    A.sort(reverse=True)
    F.sort()
    cost = []
    for i in range(len(N)):
        cost.append(A[i]*F[i])

    a = F[cost.index(max(cost))]

    return




def F():
    N, M = LI()

    value = [0] * M
    power = [0] * M
    for i in range(M):
        a, b = LI()
        value[i] = a
        c = LI()
        L = ['0'] * N
        for k in c:
            L[k - 1] = '1'
        bint = ''.join(L)
        power[i] = int(bint, 2)
    bint = ''.join(list(['1'] * N))
    dp = [inf] * (int(bint, 2)+1)
    t = 0
    cost = 0

    dp[0] = 0
    for s in range(int(bint, 2) + 1):
        for i in range(M):
            t = s | power[i]
            cost = dp[s] + value[i]
            dp[t] = min(dp[t], cost)
    print(-1) if(dp[-1] == inf) else print(dp[-1])

    return

    



def solution(S):
    
    N = len(S)

    pass



if __name__ == '__main__':
    A()

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

Solution (Python):
if __name__ == "__main__":
    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())
print(r * r)

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

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

Solution (Python):

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

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

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

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

a = 1*1
b = r*r

print(r*r)

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


if __name__ == '__main__':
    main()

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

print(r**2)

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

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

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(int(r**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 numpy as np
r = int(input())
a = r**2
print(a)

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

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

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

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

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

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

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

print(r**2)

Solution (Python):


def solve():
    return int(input())**2

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

Solution (Python):


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

Solution (Python):

import sys
def input():
    return sys.stdin.readline().rstrip()

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

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

Solution (Python):
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

r = INT()

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

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

import sys










def main():
    r = int(sys.stdin.readline().rstrip())
    print(r ** 2)


if __name__ == "__main__":
    main()

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

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

print(N**2)

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

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

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

Solution (Python):

from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


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




BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()

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

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

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

print(n ** 2)

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

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

print(N**2)

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

r  = INT()


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

def main():
    input = sys.stdin.readline
    N = int(input())

    return N**2

if __name__ == '__main__':
    print(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):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

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

print(a**2)

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

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

ans = r*r

print(ans)

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

print(r * r)

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

if __name__ == '__main__':
    main()

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

answer = r**2

print(answer)

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

Solution (Python):

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

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

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

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

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

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

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

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

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

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

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

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


if __name__ == '__main__':
    solve()

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

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

print(n*n)

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

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