import math
n = int(input())
lst = list(map(int, input().split()))
lst.sort()
ans=0
for i in range(n):
ans += (lst[i] * lst[i] * (1 - i%2 * 2))
z = round(math.asin(1) * 2 * ans, 10)
if z<0:
print(z*-1)
else:
print(z)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n+1] ={0};
for (int i = 0; i < n; i++)
{
cin>>a[i];
}
sort(a,a+n);
reverse(a,a+n);
double sum = 0;
for (int i = 0; i <=n; i+=2)
{
if(a[i] == 0 )
{
break;
}
sum+=(a[i]*a[i]-a[i+1]*a[i+1]);
}
//cout<<sum<<endl;
cout<<(3.1415926536*sum)<<endl;
}
1648A - Weird Sum | 427A - Police Recruits |
535A - Tavas and Nafas | 581A - Vasya the Hipster |
1537B - Bad Boy | 1406B - Maximum Product |
507B - Amr and Pins | 379A - New Year Candles |
1154A - Restoring Three Numbers | 750A - New Year and Hurry |
705A - Hulk | 492B - Vanya and Lanterns |
1374C - Move Brackets | 1476A - K-divisible Sum |
1333A - Little Artem | 432D - Prefixes and Suffixes |
486A - Calculating Function | 1373B - 01 Game |
1187A - Stickers and Toys | 313B - Ilya and Queries |
579A - Raising Bacteria | 723A - The New Year Meeting Friends |
302A - Eugeny and Array | 1638B - Odd Swap Sort |
1370C - Number Game | 1206B - Make Product Equal One |
131A - cAPS lOCK | 1635A - Min Or Sum |
474A - Keyboard | 1343A - Candies |