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.

Examples

Input

3
4

Output

5

Input

19
100

Output

261

Input

10
0

Output

100

见题面

见题面