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


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

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

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

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

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

Solution (Python):


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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):

N=int(input())
A=int(input())
sum=N*N
if (1<=N and N<=100) and (0<=A and A<=N**N):
    print(sum-A)

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

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

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

ans = n*n-a

print(ans)

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

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

print(n * n - a)

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

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

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

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

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

print(n * n - a)

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

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

Solution (Python):
N = int(input())
M = int(input())
print(N**2 - 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):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    N = int(readline())
    A = int(readline())
    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*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**2 - A)

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

Solution (Python):



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

i = N * N
result = i - A

print(result)

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):
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())
m = m*m
print(m - n)

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

Solution (Python):


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

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

Solution (Python):












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


result = (n * n) - a

print(result)

Solution (Python):





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

print((N * N) - A)

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

print(N ** 2 - A)

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

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

if n ** 2 - a < 0:
    print(0)
else:
    print(n ** 2 - a)

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

y = n * n
x = y - a

print(x)

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

print(N ** 2 - A)

Solution (Python):

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


answer = N ** 2 - A


print(answer)

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

print(N * N - A)

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

get_colored_cells()

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

print(N ** 2 - A)

Solution (Python):




n = int(input())
white = int(input())


black = n ** 2 - white


print(black)

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

print(N * N - A)

Solution (Python):

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


answer = N ** 2 - A


print(answer)

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

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


N *= N


B = N - A
print(B)

Solution (Python):


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

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

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

Solution (Python):

N = int(input())
A = int(input())
Total = N ** 2


Black = Total - A
print(Black)

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

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

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

Solution (Python):
S_list = [int(input()) for i in range(2)]

print(S_list[0]**2 - S_list[1])

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

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

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

Solution (Python):









N = int(input())


A = int(input())



square_num = N * N



answer = square_num - A


print(answer)

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


answer = n * n - a


print(answer)

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

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

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

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

total_space = n_line * n_line
num_a_painted_black = total_space - num_a_painted_white

print(num_a_painted_black)

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

print(N ** 2 -A)

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    N = I()
    A = I()

    print(N ** 2 - A)

if __name__ == '__main__':
    resolve()

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

print(n ** 2 - w)

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(max(0,(N**2)-A))

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

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

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

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

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

print((n*n)-a)

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

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

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

Solution (Python):

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


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

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

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

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

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

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

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

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 input(): return sys.stdin.readline().strip()

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**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
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
import numpy as np
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 * N - A)

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

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

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


if __name__ == "__main__":
    solve()

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
A = I()
print(N**2-A)

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N, A = map(int, read().split())

    print(N * N - A)

    return


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys
read=sys.stdin.read

n,a=map(int,read().splitlines())

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

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

print(n * n - a)

Solution (Python):

import math

N = int(input())
K = int(input())

ans = 1

print(N**2-K)

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

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

Solution (Python):
N = int(input())
A = int(input())
N_all = N*N
print(N_all-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
def I(): return int(sys.stdin.readline().rstrip())

print(I()**2-I())

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

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

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())
N = n*n
res = N -a
print(res)

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

ans = N**2 - A

print(ans)

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

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

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

print(ans)

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):
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())**2
print(a-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())
pixel=n**2
print(pixel-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 bichromeCells(n, a):
    return n*n -a


def main():
    n = int(input())
    a = int(input())
    print(bichromeCells(n, a))

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=map(int,open(0))
print(n*n-a)

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

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

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

if N < 1 or N > 100:
    sys.exit()
if A < 0 or A > N ** 2:
    sys.exit()

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

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

print(X-A)

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

N_sq = N * N

black = N_sq - A

print(black)

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

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

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

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

answer = (N * N) - A

print(answer)

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

answer=(N*N)-A

print(answer)

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

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

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

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

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

print(a**2 - b)

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

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

Solution (Python):



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


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


if __name__ == "__main__":
    main()

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

ans = a*a-b
print(ans)

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

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

Solution (Python):
import sys
import heapq
import re
from heapq import heapify, heappop, heappush
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from fractions import gcd
from math import factorial, sqrt, ceil
from functools import lru_cache, reduce
INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


def dijkstra_heap(s, edge, n):
    
    d = [10**20] * n
    used = [True] * n 
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr


def lcm(x, y):
    return (x * y) // gcd(x, y)


def lcm_list(numbers):
    return reduce(lcm, numbers, 1)


def gcd_list(numbers):
    return reduce(gcd, numbers)


def is_prime(n):
    if n <= 1:
        return False
    p = 2
    while True:
        if p ** 2 > n:
            break
        if n % p == 0:
            return False
        p += 1
    return True



def eratosthenes(limit):
    A = [i for i in range(2, limit+1)]
    P = []

    while True:
        prime = min(A)
        
        if prime > sqrt(limit):
            break
            
        P.append(prime)
            
        i = 0
        while i < len(A):
            if A[i] % prime == 0:
                A.pop(i)
                continue
            i += 1
            
    for a in A:
        P.append(a)
            
    return P


def permutation_with_duplicates(L):

    if L == []:
        return [[]]

    else:
        ret = []

        
        S = sorted(set(L))

        for i in S:

            data = L[:]
            data.remove(i)

            for j in permutation_with_duplicates(data):
                ret.append([i] + j)

        return ret


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

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

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline


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

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

Solution (Python):
import math

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

print(n**2 - a)

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

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

count_black = n ** 2 - a

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