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
import java.util.Scanner;
import java.util.ArrayList;
public class Main
{
  public static void main(String args[])
  {
    Scanner input=new Scanner(System.in);
    
    int g=input.nextInt();
    int w=input.nextInt();
    if(g>=1 && g<=100 && w>=0 && w<= (g*g))
    {
      g=g*g;
      w=g-w;
      System.out.println(w);
    }
  }
}