Problem: NN is an experienced internet user and that means he spends a lot of time on the social media. Once he found the following image on the Net, which asked him to compare the sizes of inner circles:

<image>

It turned out that the circles are equal. NN was very surprised by this fact, so he decided to create a similar picture himself.

He managed to calculate the number of outer circles n and the radius of the inner circle r. NN thinks that, using this information, you can exactly determine the radius of the outer circles R so that the inner circle touches all of the outer ones externally and each pair of neighboring outer circles also touches each other. While NN tried very hard to guess the required radius, he didn't manage to do that. 

Help NN find the required radius for building the required picture.

Input

The first and the only line of the input file contains two numbers n and r (3 ≤ n ≤ 100, 1 ≤ r ≤ 100) — the number of the outer circles and the radius of the inner circle respectively.

Output

Output a single number R — the radius of the outer circle required for building the required picture. 

Your answer will be accepted if its relative or absolute error does not exceed 10^{-6}.

Formally, if your answer is a and the jury's answer is b. Your answer is accepted if and only when (|a-b|)/(max(1, |b|)) ≤ 10^{-6}.

Examples

Input

3 1


Output

6.4641016


Input

6 1


Output

1.0000000


Input

100 100


Output

3.2429391

Solution (in JAVA):

Solution:


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

public class prime {
	 static long  primeFactors(int n)
	{long count=0;
	    
	    if(n==1)
	    {
	        return 0;
	    }// Print the number of 2s that divide n
	    if(n%2==0)
	    {
	        
	    count++;
	    while (n%2 == 0)
	    {
	        
	        n = n/2;
	    }
	    }
	    // n must be odd at this point.  So we can skip 
	    // one element (Note i = i +2)
	    for (int i = 3; i <= Math.sqrt(n); i = i+2)
	    {
	        // While i divides n, print i and divide n
	        if(n%i==0)
	        {
	            count++;
	        while (n%i == 0)
	        {
	            
	            n = n/i;
	        }
	            
	        }
	        
	    }
	 
	    // This condition is to handle the case when n 
	    // is a prime number greater than 2
	    if (n > 2)
	    {
	        count++;
	    }
	return count;
	}

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
Scanner in=new Scanner(System.in);
  BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
TreeSet<Long> set=new TreeSet<Long>();
HashMap<Integer,Integer>map=new HashMap<Integer,Integer>();
ArrayList<Integer> list=new ArrayList<Integer>();
int n=in.nextInt();
int r=in.nextInt();

double theta=(double)360/(double)n;

double b=1-((double)2/(double)(1-Math.cos((double)2*Math.PI/(double)n)));
double x=Math.sqrt(1-b)-1;
double ans=(double)r/(double)x;
System.out.println(ans);
	
	
	
	}
	

}