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 functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


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


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


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


n, a = inpm(2)
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= list(map(int, [input().rstrip() 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())
RE=N*N-A
print(RE)

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

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

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

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

print(n ** 2 - a)

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

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

print(n**2- s)

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

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

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

Solution (Python):

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

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

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

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

if b > 0:
    print(b)
else:
    print(0)

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

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007


n,a = IR(2)
print(n**2-a)



"""
a,b,c,d,e,f = LI()
a *= 100
b *= 100
ans = [a,0]
for i in range(f//a+1):
    for j in range((f-a*i)//b+1):
        for k in range((f-a*i-b*j)//c+1):
            for l in range((f-a*i-b*j-c*k)//d+1):
                if i or j or k or l:
                    s = c*k+d*l
                    w = a*i+b*j
                    q = w*e//100
                    if s <= q:
                        if w+s <= f:
                            if ans[1]/ans[0] < s/(s+w):
                                ans = [w+s,s]
print(*ans)
"""


"""
n = I()
d = LIR(n)
l = [[1 for j in range(n)] for i in range(n)]
for k in range(n):
    for i in range(n):
        for j in range(n):
            if d[i][j] > d[i][k]+d[k][j]:
                print(-1)
                quit()
            if d[i][j] == d[i][k]+d[k][j]:
                l[i][j] = l[i][k]+l[k][j]

ans = 0
for i in range(n):
    for j in range(n):
        if l[i][j] == 4:
            ans += d[i][j]
ans //= 2
print(ans)
"""

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

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

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

Solution (Python):


import itertools
import collections
import bisect

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

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

Solution (Python):
import sys

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

    print(N**2 - 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):
def bichrome_cells(N: int, A: int)->int:
    return N*N - A


if __name__ == "__main__":
    N = int(input())
    A = int(input())
    ans = bichrome_cells(N, A)
    print(ans)

Solution (Python):
one_side=input()
oneside=int(one_side)
whole=oneside**2
white_side=input()
whiteside=int(white_side)
print(whole-whiteside)

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

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

Solution (Python):



def func(n, a):
    result = n * n - a
    return result


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

block = N * N
ans = block - A

print(ans)

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

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

print(N**2-A)

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

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

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

Solution (Python):
n,a=[int(input()) for i in range(2)]
print(min(n**2,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):
a,b=[int(input()) for _ in range(2)]
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):
def get_num():
    n = int(input())
    w = int(input())
    return n,w

def check_range(n,w):
    return n in range(1,101) and w in range(n**2+1)

def black_tiles(n,w):
    if (check_range(n,w)):
        return n**2 - w
    else:
        raise Exception('Value out of range')

if (__name__=='__main__'):
    print(black_tiles(*get_num()))

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

ans = N * N - A

print(ans)
print()

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

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

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

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

Solution (Python):
import heapq
from collections import deque
from enum import Enum
import sys
import math
from _heapq import heappush, heappop

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001


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

print("%d"%(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*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,a=[int(input()) for i in range(2)]
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):
print(int(input())**2-int(input()))

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

all_cells = N * N
black_cells = all_cells - A
print(black_cells)

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

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

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

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

MASU = N*N
black = MASU - A
print(black)

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

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

if __name__ == '__main__':
  main()

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

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

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


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

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

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

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

Solution (Python):



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


if __name__ == "__main__":
    main()

Solution (Python):
from statistics import mean, median,variance,stdev
import sys
import math




x = int(input())
y = int(input())

print(pow(x,2)-y)

Solution (Python):

N = int(input())
A = int(input())
print("{}".format(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(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=0
ans=N*N-A
print(ans)

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

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

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

print(n*n-a)

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

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

num = N * N - A
print(num)

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

print(N * N - A)

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

Solution (Python):


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

s=a*a-b

print(s)

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

Solution (Python):
print(eval(input()+'**2-'+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())
ans = (N**2) - A
print(ans)

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

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

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

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

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

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

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

print(n**2-a)

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
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]

def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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, a = [int(input()) for i 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):
N = int(input())
A = int(input())
print(N * N - A)

Solution (Python):


N1 = int( input() )
N = N1 ** 2

A = int( input() )

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

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):
n, a = [int(input()) for s in range(2)]
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):
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())
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())
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):
lis = [int(input()) for i in range(2)]
print(lis[0] ** 2 - lis[1])

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

b = input()

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

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

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

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

re = N * N - A
print(re)

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

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

Solution (Python):


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

cells = N ** 2

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

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

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

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

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


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

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

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