CodeForces - 140A --New Year Table--计算几何大圆和小圆的相容

Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all those guests. Consider all plates to be round and have the same radii that equal r. Each plate must be completely inside the table and must touch the edge of the table. Of course, the plates must not intersect, but they can touch each other. Help Gerald determine whether the table is large enough for n plates.

Input

The first line contains three integers n, R and r (1 ≤ n ≤ 100, 1 ≤ r, R ≤ 1000) — the number of plates, the radius of the table and the plates' radius.

Output

Print "YES" (without the quotes) if it is possible to place n plates on the table by the rules given above. If it is impossible, print "NO".

Remember, that each plate must touch the edge of the table.

Examples

Input

4 10 4

Output

YES

Input

5 10 4

Output

NO

Input

1 10 10

Output

YES

Note

The possible arrangement of the plates for the first sample is:

问这个大圆是否能包容下N个小圆。

利用角度关系，一开始想的是利用正方形面积判断，不对。

角度关系就是：圆心角等于2*ARCSIN(r/(R-r))，一共是2*PI，故判断PI与N*2*ARCSIN(r/(R-r))的关系即可。但是这里要注意精度。

 

#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<string.h>
using namespace std;
#define ll long long
const int mod=1e9+7;
const int maxn=1e5+10;
int num[maxn];
double PI=acos(-1);
int main()
{
    double n,R,r;
    cin>>n>>R>>r;
    double du=asin(r/(R-r));
    if(n==1)
    {
        if(R>=r)
        {
            cout<<"YES"<<endl;
        }else
        {
           cout<<"NO"<<endl;
        }
        return 0;
    }
    if(PI-n*du>-1e-12)
    {
        cout<<"YES"<<endl;
    }else{
        cout<<"NO"<<endl;
    }

}