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

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

print(n*n -k)

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n = ii()
    a = ii()
    print(n**2 - a)


if __name__ == "__main__":
    main()

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

print(-A+N**2)

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):
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):
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 li():
    return list(map(int, input().split()))
def mi():
    return map(int, input().split())
def ii():
    return int(input())

N = ii()
A = ii()

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n, a = [int(readline()) 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):
x = int(input())
y = int(input())
print(x**2-y)

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

tmp = N**2-A

if tmp >= 0:
    print(tmp)
else:
    print(N**2)

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

Solution (Python):


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

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

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

Solution (Python):
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())
n = i()
a = i()
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):
import sys

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


def resolve():
    n = int(input())
    a = int(input())

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


if __name__ == '__main__':
    resolve()

Solution (Python):

"""
Created on Thu May 14 11:24:50 2020

@author: shinba
"""

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

print(n**2-a)

Solution (Python):

N, A = map(int, open(0))  
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 * N - 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**2 - A)

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

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

x = n*n-a
print(x)

Solution (Python):
import sys
import math
import bisect

def main():
    n = int(input())
    a = int(input())
    print(n ** 2 - a)
    
if __name__ == "__main__":
    main()

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

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

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 main():
    n = int(input())
    a = int(input())
    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):
def ABC_74_A():
    N = int(input())
    A = int(input())
    print(N*N-A)

if __name__ == '__main__':

    ABC_74_A()

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

print(n**2 - a)

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

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

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

if __name__ == '__main__':
    main()

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

Solution (Python):
a,b=map(int,open(0));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):

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

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)
resolve()

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

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

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

n = int(input())
a = int(input())
c = n**2
print(c-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):
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*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):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

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

masu = n ** 2

print(masu - a)

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

Solution (Python):











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

N=n*n

ans=N-a

print(ans)

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

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

    print(N**2 - A)

if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

n=I()
a=I()
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(max(0,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 = input()
A = input()
N = int(N)
A = int(A)
print( N ** 2 - A)

Solution (Python):
n=int(input())
a=int(input())
print(max(n**2-a, 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):
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):
from sys import stdin

def main():
    n = int(stdin.readline())
    w = int(stdin.readline())

    print(n ** 2 - w)

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

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

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

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

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())
s=a*a
t=s-b
print(t)

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

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


if '__main__' == __name__:
    resolve()

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

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

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

print(a*a -b)

Solution (Python):
import sys

lines = sys.stdin.readlines()

N = int(lines[0])
A = int(lines[1])

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
N = int(input())
print(N**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())
ans = N * N - 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):
import math
import string
import collections
from collections import Counter


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

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

answer = (N * N) - A

print(answer)

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

print(n*n-a)

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

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

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

Solution (Python):
import sys

n, a = map(int, sys.stdin.read().split())

def main():
    print(n**2 - a)

if __name__ ==  '__main__':
    main()

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

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

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

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

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

ans = N**2 - A

print(ans)

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

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

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

Solution (Python):
N,A=map(int,open(0));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):
import math
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**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):

import sys


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


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

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

i = n*n

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

Solution (Python):


import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

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

def main():
    import sys
    
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    
    from itertools import combinations, permutations
    
    from bisect import bisect_left,bisect_right
    from math import floor, ceil
    

    

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

if __name__ == '__main__':
    main()

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

print(n*n-a)

Solution (Python):
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = int(sys.stdin.readline().rstrip())
    A = int(sys.stdin.readline().rstrip())
    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**2-a)

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

print((N**2) - A)

Solution (Python):
n = int(input().strip())
a = int(input().strip())
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):
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = int(sys.stdin.readline().rstrip())
    A = int(sys.stdin.readline().rstrip())
    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**2 - a)

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

menseki = n**2
print(int(menseki-a))

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

print(N**2-A)

Solution (Python):
from sys import stdin

n = int(stdin.readline().rstrip())
a = int(stdin.readline().rstrip())

print(n**2 - a)

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