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;

/**
 *
 * @author lenovo
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int A = sc.nextInt();
        System.out.println(N*N-A);
    }
    
}
