Problem:
 Score : 100 points    Problem Statement We have an N \times N square grid.  We will paint each square in the grid either black or white.  If we paint exactly A squares white, how many squares will be painted black?      Constraints  1 \leq N \leq 100  0 \leq A \leq N^2         Inputs Input is given from Standard Input in the following format:  N  A       Outputs Print the number of squares that will be painted black.        Sample Input 1 3
4      Sample Output 1 5  There are nine squares in a 3 \times 3 square grid.
Four of them will be painted white, so the remaining five squares will be painted black.       Sample Input 2 19
100      Sample Output 2 261       Sample Input 3 10
0      Sample Output 3 100  As zero squares will be painted white, all the squares will be painted black.

Solution (Python):
print('{}'.format(int(input())**2-int(input())))

Solution (Python):

a = int(input())
b = int(input())
c = a**2-b
print(c)

Solution (Python):
a=input()
b=input()
A=int(a)
B=int(b)
c=A**2-B
print(c)

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

Solution (Python):
inn = int(input())
ina = int(input())

print(inn * inn - ina)

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

Solution (Python):
total = int(input()) ** 2
white = int(input())
print(total - white)

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

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

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

Solution (Python):


n = int(input())
a = int(input())

print(n*n-a)

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

n = ni()
a = ni()
print(n**2-a)

Solution (Python):
N = int(raw_input())
A = int(raw_input())

print N*N - A

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

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

print((n*n)-a)

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

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

print(N ** 2 - A)

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

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

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

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

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

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

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

print(n*n-a)

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

print(n*n-a)

Solution (Python):

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

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

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

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

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

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

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

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

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

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

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

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

print(n**2 - a)

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

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

print(a ** 2 -b)

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

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

cell_all = n * n
ans = cell_all - a
print(ans)

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

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

print(N*N - A)

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

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

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

Solution (Python):

n = int(input())
a = int(input())

print(n * n - a)

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

print(N**2 - A)

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

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

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

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

n = int(arr_data[0][0])
a = int(arr_data[1][0])


print(n * n-a)

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

ans = N ** 2 - A

print(ans)

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

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

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

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

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

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

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

Solution (Python):

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

Solution (Python):





if __name__ == '__main__':
    N = int(input())
    white_count = int(input())

    black_count = N ** 2 - white_count
    print(black_count)

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

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


sys.setrecursionlimit(10000)


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


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


def dim2input(N):
    li = []
    for _ in range(N):
        li.append(input().split())
    return li



dp = None

def main():
    N = int(input())
    A = int(input())

    print(N*N - A)

main()

Solution (Python):


N = int(input())
A = int(input())
print(N ** 2 - A)

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

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

print(n * n - a)

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

Solution (Python):
N = raw_input()
A = raw_input()

print(int(N)**2-int(A))

Solution (Python):
n,a=(int(input()) for i in range(2))
print(n**2-a)

Solution (Python):
n,a=(int(input()) for _ in range(2))
print(n**2-a)

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

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

print(N**2-A)

Solution (Python):
A = int(input())
B = int(input())

print(A**2 - B)

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

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

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

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

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

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

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

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

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

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

Solution (Python):
n = input()
a = input()
print n*n-a

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

Solution (Python):
n,a=[int(input()) for _ in range(2)]
print(n*n-a)

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

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

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

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

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

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

Solution (Python):
print(eval(input()+"**2-"+input()))

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

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

j = int(n)*int(n)-int(a)
print(j)

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

j = int(n)*int(n)-int(a)
print(j)

Solution (Python):



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


print(n - a)

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

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

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

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

Solution (Python):


def main():
    N = int(input())
    A = int(input())
    print((N * N) - A)

if __name__ == '__main__':
    main()

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

ans = N**2-A
print(ans)

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

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

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

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

A = int(input())

print(N**2-A)

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

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

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

def main():
    """
    main.
    """
    ans = N ** 2 - A
    print(ans)

if __name__ == '__main__':
    main()

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

print(N**2-A)

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

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

print(N * N - A)

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

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

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

print(N * N - A)

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

print(N * N - A)

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

print(N * N - A)

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

Solution (Python):
from sys import stdin

N = int(stdin.readline())
A = int(stdin.readline())
print(N ** 2 - A)

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

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

Solution (Python):
N=int (raw_input())
A=int(raw_input())
print N*N-A

Solution (Python):


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

	mass = n * n

	print(mass - a)

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

Solution (Python):
N = int(raw_input())
A = int(raw_input())
print N*N - A

Solution (Python):
import numpy as np

N = int(input())
A = int(input())

print(N**2 - A)

Solution (Python):

N = int(input())
A = int(input())
print((N * N) - A)

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

area = N * N
kuro = area - A 

print(kuro)

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

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

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

A = int(input())

print(str(N**2-A))

Solution (Python):
if __name__ == '__main__':

    N = int(input())
    A = int(input())
    print(N*N - A)

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

Solution (Python):


n = int(input())
a = int(input())

print(n ** 2 - a)

Solution (Python):

a=int(input())
b=int(input())

print(a*a-b)

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

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

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

print(n*n - a)

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

Solution (Python):

a,b=int(input()),int(input())
print(a*a-b)

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

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

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

print(N*N-A)

Solution (Python):
N = int(input())
A = int(input())
result = N**2 - A
print(str(result))

Solution (Python):
n, a = [int(input()) for _ in range(2)]
print(n*n-a)

Solution (Python):

input1 = int(input())
input2 = int(input())

print (input1*input1 - input2)

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

Solution (Python):
N=raw_input()
A=raw_input()
print(int(N)*int(N)-int(A))

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

Solution (Python):
N=input()
A=input()
print N*N-A

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

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

print(N**2-A)

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

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

print(n*n-x)

Solution (Python):
if __name__ == "__main__":
    N = int(input())
    A = int(input())
    print(N * N - A)

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

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

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

Solution (Python):
def count_black(N, A):
    return N**2 - A

N = int(raw_input())
A = int(raw_input())

print(count_black(N, A))

Solution (Python):

N = int(input())
A = int(input())

N_Squares = N*N

W_Squares = N_Squares - A

print (W_Squares)

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

Solution (Python):

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

Solution (Python):
print pow(int(raw_input()),2)-int(raw_input())

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

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

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

Solution (Python):
if __name__ =='__main__':
    N = int(input())
    A = int(input())
    ans = N**2-A
    print(ans)

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

Solution (Python):
(lambda N, A: print(N * N - A))(int(input()), int(input()))

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = float("inf")


def main():
    N = int(input())
    A = int(input())
    print(N * N - A)


if __name__ == '__main__':
    main()

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

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

print(N*N - A)

Solution (Python):
N = int(input())
A = int(input())
 
print(pow(N, 2) - A)

Solution (Python):

N = int(input())

A = int(input())


print(N * N - A)

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

Solution (Python):


N = int(input())
A = int(input())

print(N*N-A)

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

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

print(N*N - A)

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

print(N*N-A)

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

Solution (Python):



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

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

Solution (Python):
a = int(raw_input())
b = int(raw_input())
print a*a-b

Solution (Python):
N = int(input())
A = int(input())
T = N ** 2 - A
if N<100 :
    print(T)
else :
    print(0)

Solution (Python):
N = int(input())
A = int(input())
T = N ** 2 - A
if N<100 :
    print(T)
else :
    print(0)

Solution (Python):
N = int(input())
A = int(input())
T = N ** 2 - A
if N<100 :
    print(T)
else :
    print(0)

Solution (Python):
N = int(input())
A = int(input())
T = N ** 2 - A
if N<=100 :
    print(T)
else :
    print(0)

Solution (Python):
N = int(input())
A = int(input())
T = N ** 2 - A
if N<100 :
    print(T)
else :
    print(0)

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

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

Solution (Python):
a = [int(input()) for i in range(2)]
print(a[0] ** 2 - a[1])

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

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


print(n**2 - a)

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

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

Solution (Python):

"""A - Bichrome Cells"""

n = int(raw_input())
a = int(raw_input())

print n * n - a

Solution (Python):

N = int(input())
A = int(input())

N = N * N

Black = N  - A

print(Black)

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
import sys

def main():
    N = int(input())
    A = int(input())
    black = N**2-A
    print(black)

if __name__=='__main__':
    main()

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

print(N**2-a)

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

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

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

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

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

print(n*n-a)

Solution (Python):

n = int(input())
m = int(input())

print(n * n - m)

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

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7

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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


def main():
    n = I()
    a = I()

    return n**2 - a


print(main())

Solution (Python):



n = int(input())

a = int(input())

print(str(n*n - a))

Solution (Python):

N = int(input())
A = int(input())
print(N*N-A)

Solution (Python):
N, A = input(), input()
print (N**2 - A)

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

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

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

Solution (Python):
if __name__ == '__main__':
    N = input()
    A = input()

    print (N*N - A)

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

ans = n*n-a
print(ans)

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

print(n*n-a)

Solution (Python):

n=int(raw_input())
a=int(raw_input())
print n*n-a

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

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

Solution (Python):
N = raw_input()
N = int(N)
A = raw_input()
A = int(A)

print(N*N-A)

Solution (Python):
from sys import  stdin
n = int(stdin.readline())
a = int(stdin.readline())
print n*n-a

Solution (Python):

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

Solution (Python):
import sys

N = int(sys.stdin.readline())
A = int(sys.stdin.readline())
print(N*N - A)

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

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

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

B = N ** 2 - A

print(B)

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

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

print(N**2-w)

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

print(N**2-A)

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

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

Solution (Python):




def main():
    n = int(input())
    a = int(input())
    print(n*n-a)

if __name__ == '__main__':
    main()

Solution (Python):
def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]

n, = read_line(int)
a, = read_line(int)


print(n * n - a)

Solution (Python):


N = int(input())
A = int(input())
print(N**2 - A)

Solution (Python):
n=input()
a=input()
print n*n-a

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

Solution (Python):
n = int(input())
a = int(input())
check = n*n
black = check - a
print(black)

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

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

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

print(N*N-A)

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

Solution (Python):
N=int(raw_input())
A=int(raw_input())

print N**2-A

Solution (Python):
n = int(raw_input())
a = int(raw_input())
x = n*n - a 
print x

Solution (Python):
N, A = int(input()), int(input())
print(N*N-A)

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

print  n ** 2 - a

Solution (Python):


N=int(input().rstrip())
A=int(input().rstrip())
print((N**2)-A,flush=True)

Solution (Python):
def main():
    N = int(input())
    M = int(input())

    print (N**2-M)



if __name__ == "__main__":
    
    
    main()

Solution (Python):
import sys




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


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


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


def read_str():
    return input()


def main():
    n = read_int()
    a = read_int()
    res = n * n - a
    print(res)


main()

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

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

print(n * n - a)

Solution (Python):



n = int(raw_input())
a = int(raw_input())

s = n*n - a

print s

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

Solution (Python):
N = int(input())
A = int(input())
    
S = N * N
    
ANS = A - S
ANS = abs(ANS)
    
print (ANS)

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

Solution (Python):
import sys


def read_numbers():
    return [int(num) for num in sys.stdin.readline().split()]
def read_string():
    return sys.stdin.readline().rstrip('\r\n')
def list2str(*array):
    return ' '.join([str(i) for i in array])

def main(N, A):
    return N*N - A

def parse_stdin():
    
    
    
    
    N = read_numbers()[0]
    A = read_numbers()[0]
    return N, A

def test_main():
    """run pytest stdin.py to test"""
    
    pass

if __name__ == '__main__':
    N, A = parse_stdin()
    result = main(N, A)
    print(result)

Solution (Python):
def main():
    N = int(input())
    A = int(input())
    
    print(N**2 - A)
    
if __name__=="__main__":
    main()

Solution (Python):
def main():
    N = int(input())
    A = int(input())

    print(N ** 2 - A)

if __name__ == '__main__':
    main()

Solution (Python):
def main():
    N = int(input())
    A = int(input())

    ans = N ** 2 - A
    print(ans)

main()

Solution (Python):


n = int(input())
a = int(input())

result = n * n - a
print(result)

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

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

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

print(N*N - A)

Solution (Python):
number_of_test = int(input())
number_of_test2 = int(input())

print((number_of_test*number_of_test)-number_of_test2)

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

ans=N*N-A

print(ans)

Solution (Python):


import sys

def main(argv):
    line = sys.stdin.readline()
    while line:
        N = int(line)
        A = int(sys.stdin.readline())
        print(N * N - A)

        line = sys.stdin.readline()

if __name__ == "__main__":
    main(sys.argv)

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

print(N ** 2 - A)

Solution (Python):
N=input()
A=input()
print N*N-A

Solution (Python):
N,A = input(),input()

ans = N*N-A
print(ans)

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

Solution (Python):
use = int(input())
use1 = int(input())

print(use ** 2 - use1)

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

print(n * n - a)

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

if __name__=='__main__':
    main()

Solution (Python):
if __name__ == '__main__':
    N = int(input())
    A = int(input())
    print(N ** 2 - A)

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

Solution (Python):
N = int(input())
A = int(input())
ans = N * N -A
print(str(ans))

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

print(N ** 2 - A)

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

print(n**2 - a)

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

Solution (Python):


N = int(input())
A = int(input())

print(N * N - A)

Solution (Python):
def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]

n=i1()
a=i1()
print(n**2-a)

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

Solution (Python):
N=(int)(input())
A=(int)(input())
print(str(N*N-A))

Solution (Python):


n = int(input())
a = int(input())

print(n*n - a)

Solution (Python):

"""
https://beta.atcoder.jp/contests/abc074/tasks/abc074_a

"""
import sys
from sys import stdin
input = stdin.readline


def main(args):
    N = int(input())
    A = int(input())
    print(N**2 - A)


if __name__ == '__main__':
    main(sys.argv[1:])

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

print(n**2 - a)

Solution (Python):


N = int(input())
A = int(input())

print(N**2-A)

Solution (Python):


n = input()
a = input()

print n**2-a

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

print(n * n - a)

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


if __name__ == "__main__":
    main()

Solution (Python):
X = int(input()) 
A = int(input()) 
ans = X*X - A
print(ans)

Solution (Python):
n=int(raw_input(''))
a=int(raw_input(''))

print (n*n)-a

Solution (Python):
N = int(input())
A = int(input())
ans = N*N - A
print(ans)

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

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

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

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

print(n**2-a)

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

Solution (Python):

N = int(input())
A = int(input())
print(N**2-A)

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

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

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

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

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

print(N*N - A)

Solution (Python):
n = int(input().strip())
a = int(input().strip())

print(n*n-a)

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

ans = (N*N)-A
print(ans)

Solution (Python):



from collections import defaultdict
from math import factorial as f
from fractions import gcd as g

N = int (raw_input ())
A = int (raw_input ())
print N * N - A

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

print(n**2 - a)

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

print(N**2 - A)

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

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

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

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

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

Solution (Python):

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


def get_ln_int_inputs():
    return list(map(int, get_ln_inputs()))


def main():
    N = get_ln_int_inputs()[0]
    A = get_ln_int_inputs()[0]
    print(N * N - A)
    return


main()