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

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
n=int(input())
a=int(input())

print(n**2-a)

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

print(n**2 - a)

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


if __name__ == "__main__":
    resolve()

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

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
x=int(input())
a=int(input())

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

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

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

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, A=[int(input()) for i in range(2)]
print(N**2 - A)

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

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

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

    print(max(0, N*N - A))

if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
n = int(input())
a = int(input())
if 1 <= n <= 100 and 0 <= a <= n ** 2:
    print(n ** 2 - a)
else:
    print('hoge!')

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

n = ni()
a = ni()
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(str(N**2-A))

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

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

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):
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,a=[int(input()) for _ in range(2)]
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())

ans = N**2 - A

print(ans)

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

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

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

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

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

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

Solution (Python):
N, A = map(int, [input() for _ in range(2)])
print(N ** 2 - A)

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

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

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

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

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

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

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

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


if __name__ == "__main__":
    test()

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

Solution (Python):
n, a = [int(input()) for _ in range(2)]
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**2-a)

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

Solution (Python):
n, a = map(int, [input() for _ in range(2)])
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):
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(int((n*n) - a))

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

print(int(n*n-m))

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

print(N**2-A)

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

Solution (Python):
N,A=[int(input()) for _ in range(2)]
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):
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):
print(pow(int(input()),2) - int(input()))

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

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

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

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, a = [int(input()) for _ in range(2)]
print(n**2-a)

Solution (Python):
N,A = map(int,open(0).read().split())
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**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**2-a)

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

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

print((a * a) - b)

Solution (Python):
n,a=map(int,open(0).read().split())
print(n*n-a)

Solution (Python):
n,a=map(int,open(0).read().split())
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**2-a)

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

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

Solution (Python):

import sys


def solve(N: int, A: int):
    print(N**2-A)
    return



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

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

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

nA = N**2 - A

print(nA)

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

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

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*N-A)

Solution (Python):
if __name__ == '__main__':
    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):
n, a = [int(input()) for _ in range(2)]
print(n * n - a)

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

print(a**2-b)

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

import sys
INF = float("inf")


def solve(N: int, A: int):
    print(N**2-A)
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    A = int(next(tokens))  
    solve(N, A)


if __name__ == '__main__':
    main()

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

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

if __name__ == "__main__":
    main47()

Solution (Python):

import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math






def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    A = inputInt()
    
    tmp = N*N
    print(tmp-A)
    
            	
if __name__ == "__main__":
	main()

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

Solution (Python):
N, A = map(int, (input() for _ in range(2)))

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

B = N * N - A
print(B)

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

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,A = [int(input()) for i in range(2)]
print(N**2-A)

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

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 = 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):
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 LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
A = INT()
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())
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())

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

Solution (Python):
n,a=map(int,open(0))
print(n*n-a)

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

print(n ** 2 - a)

Solution (Python):

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


def A():
    n, a = II(), II()
    print(n*n-a)
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

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

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

Solution (Python):
a,b=[int(input())for i in range(2)]
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):
N=int(input())
A=int(input())
X=N**2-A
print(X)

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

Solution (Python):
masu = int(input())**2
white = int(input())

print(masu-white)

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

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

Solution (Python):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

N = n()
A = n()

print(N*N-A)

Solution (Python):

import sys


def solve(N: int, A: int):
    print(N*N - A)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    A = int(next(tokens))  
    solve(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())
x = n**2 - a
if x >= 0:
    print(x)
else:
    print(0)

Solution (Python):
n = int(input())
a = int(input())
x = n**2 - a
if x >= 0:
    print(x)
else:
    print(0)

Solution (Python):
n = int(input())
a = int(input())
x = n**2 - a
if x >= 0:
    print(x)
else:
    print(0)

Solution (Python):
n = int(input())
a = int(input())
x = n**2 - a
if x >= 0:
    print(x)
else:
    print(0)

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

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

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


main()

Solution (Python):



N = int(input())
white = int(input())
NN = N ** 2

print(NN - white)

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

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


abc()

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

Solution (Python):
a,b=[int(input()) for i in range(2)]
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 ** 2 - A)

Solution (Python):


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

Solution (Python):

import sys


def solve(N: int, A: int):
    ret = N * N - A
    print(ret)
    return


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

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, A = [int(input()) for _ in range(2)]
print(N * N - A)

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

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

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

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

Solution (Python):
import math


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





if __name__ == '__main__':
    main()

Solution (Python):

import sys
input = sys.stdin.readline

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

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

print(a**2-b)

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

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

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

print(a**2-b)

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

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

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

print(N**2-A)

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

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

Solution (Python):
import sys


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








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

Solution (Python):
N,A=[int(input()) for _ in range(2)]
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):
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,A = [int(input()) for _ in range(2)]
print(N**2 - A)

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

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

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

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

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

Solution (Python):
N,A = (int(input()) for i in range(2))
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**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**2 - a)

Solution (Python):

def read_input():
    n = int(input())
    a = int(input())
    return n, a


def submit():
    n, a = read_input()
    print(n*n - a)


if __name__ == '__main__':
    submit()

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

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

print(n**2-a)

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    n = f()[0]
    a = f()[0]
    print(n*n - a)

solve()

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

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

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

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

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

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

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


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

print(n*n - a)

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