Problem: It was decided in IT City to distinguish successes of local IT companies by awards in the form of stars covered with gold from one side. To order the stars it is necessary to estimate order cost that depends on the area of gold-plating. Write a program that can calculate the area of a star.

A "star" figure having n ≥ 5 corners where n is a prime number is constructed the following way. On the circle of radius r n points are selected so that the distances between the adjacent ones are equal. Then every point is connected by a segment with two maximally distant points. All areas bounded by the segments parts are the figure parts.

<image>

Input

The only line of the input contains two integers n (5 ≤ n < 109, n is prime) and r (1 ≤ r ≤ 109) — the number of the star corners and the radius of the circumcircle correspondingly.

Output

Output one number — the star area. The relative error of your answer should not be greater than 10 - 7.

Examples

Input

7 10


Output

108.395919545675

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e9 + 8;
const long double pi = 3.14159265359;
template <class T>
T fac(T n) {
  T res = 1, i;
  for (i = 2; i <= n; i++) res *= i;
  return res;
}
template <class T>
T lcm(T a, T b) {
  return (a * b) / __gcd(a, b);
}
template <class T>
T digitsum(T x) {
  T sum = 0;
  while (x) {
    sum += x % 10;
    x /= 10;
  }
  return sum;
}
string tostring(long long a) {
  string ans;
  while (a) {
    ans += char(a % 10 + '0');
    a /= 10;
  }
  return ans;
}
void nPermute(string str, long long n) {
  sort((str).begin(), (str).end());
  long long i = 1;
  do {
    if (i == n) break;
    i++;
  } while (next_permutation(str.begin(), str.end()));
  cout << str << endl;
}
vector<long long> factors(long long n) {
  vector<long long> f;
  for (long long x = 2; x * x <= n; x++) {
    while (n % x == 0) {
      f.push_back(x);
      n /= x;
    }
  }
  if (n > 1) f.push_back(n);
  return f;
}
bool prime(long long n) {
  if (n < 2) return false;
  for (long long x = 2; x * x <= n; x++)
    if (n % x == 0) return false;
  return true;
}
long long ncr(long long n, long long k) {
  long long res = 1;
  if (k > n - k) k = n - k;
  for (long long i = 0; i < k; i++) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
tuple<long long, long long, long long> Gcd(long long a, long long b) {
  if (b == 0)
    return {1, 0, a};
  else {
    long long x, y, g;
    tie(x, y, g) = Gcd(b, a % b);
    return {y, x - (a / b) * y, g};
  }
}
const long long mod = 1e5;
long long binpow(long long a, long long b, long long m) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res % m;
}
void solve() {
  long double n, r;
  cin >> n >> r;
  long double ang1 = 1 / (tan(pi / (2 * n))), ang2 = 1 / (tan(pi / n));
  long double ans = (n * r * r) / (ang1 + ang2);
  cout << fixed << setprecision(50) << ans << endl;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  solve();
  cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
}