Problem: One day, as Sherlock Holmes was tracking down one very important criminal, he found a wonderful painting on the wall. This wall could be represented as a plane. The painting had several concentric circles that divided the wall into several parts. Some parts were painted red and all the other were painted blue. Besides, any two neighboring parts were painted different colors, that is, the red and the blue color were alternating, i. e. followed one after the other. The outer area of the wall (the area that lied outside all circles) was painted blue. Help Sherlock Holmes determine the total area of red parts of the wall.

Let us remind you that two circles are called concentric if their centers coincide. Several circles are called concentric if any two of them are concentric.

Input

The first line contains the single integer n (1 ≤ n ≤ 100). The second line contains n space-separated integers ri (1 ≤ ri ≤ 1000) — the circles' radii. It is guaranteed that all circles are different.

Output

Print the single real number — total area of the part of the wall that is painted red. The answer is accepted if absolute or relative error doesn't exceed 10 - 4.

Examples

Input

1
1


Output

3.1415926536


Input

3
1 4 2


Output

40.8407044967

Note

In the first sample the picture is just one circle of radius 1. Inner part of the circle is painted red. The area of the red part equals π × 12 = π.

In the second sample there are three circles of radii 1, 4 and 2. Outside part of the second circle is painted blue. Part between the second and the third circles is painted red. Part between the first and the third is painted blue. And, finally, the inner part of the first circle is painted red. Overall there are two red parts: the ring between the second and the third circles and the inner part of the first circle. Total area of the red parts is equal (π × 42 - π × 22) + π × 12 = π × 12 + π = 13π

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Locale;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class AA implements Runnable {
	public static void main(String[] args) {
		new Thread(new AA()).run();

	}

	BufferedReader br;
	StringTokenizer str = new StringTokenizer("");
	PrintWriter pw;

	public Integer ni() {
		return Integer.parseInt(nextToken());
	}
	public Double nd() {
		return Double.parseDouble(nextToken());
	}

	public Long nl() {
		return Long.parseLong(nextToken());
	}

	public boolean EOF() {
		try {
			if (!br.ready() && !str.hasMoreTokens()) {
				return true;
			}
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		return false;
	}

	public String nextToken() {
		while (!str.hasMoreTokens())
			try {
				str = new StringTokenizer(br.readLine());
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		return str.nextToken();

	}

	@Override
	public void run() {
		br = new BufferedReader(new InputStreamReader(System.in));
		pw = new PrintWriter(new OutputStreamWriter(System.out));
//		 try {
//		 br = new BufferedReader(new FileReader("input.txt"));
//		 } catch (FileNotFoundException e) {
//		 e.printStackTrace();
//		 }
//		 try {
//		 pw = new PrintWriter(new FileWriter("output.txt"));
//		 } catch (IOException e) {
//		 // TODO Auto-generated catch block
//		 e.printStackTrace();
//		 }
		solve();
		pw.close();
	}

	public void solve() {
//		int n = ni();
//		int[][] mas = new int[n + 1][n + 1];
//		for (int i = 0; i < n; i++) {
//			for (int j = 0; j < n; j++) {
//				mas[i][j] = ni();
//				mas[i][n] += mas[i][j];
//				mas[n][j] += mas[i][j];
//			}
//		}
//		int c=0;;
//		for(int i=0; i<n; i++)
//			for(int j=0; j<n; j++)
//				if (mas[i][n]>mas[n][j]) c++;
//		pw.print(c);
//		// String[] strings = new String[]
//		// TreeSet<>
		int n  = ni();
		double []mas = new double[n];
		for(int i=0; i<n; i++)
			mas[i] =nd();
		Arrays.sort(mas);
		double s =0;
		int q = (n-1)%2;
		for(int i=n-1; i>=0; i--){
			if (i%2==q) s+=Math.PI*Math.pow(mas[i], 2.0);
			else {
				s-=Math.PI*Math.pow(mas[i], 2.0);
			}
		}
		pw.print(s);
	}
}