Problem: Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the minimum angle with the vertex at the origin of coordinates and with all mannequins standing inside or on the boarder of this angle. 

As you spend lots of time "glued to the screen", your vision is impaired. So you have to write a program that will pass the check for you.

Input

The first line contains a single integer n (1 ≤ n ≤ 105) — the number of mannequins.

Next n lines contain two space-separated integers each: xi, yi (|xi|, |yi| ≤ 1000) — the coordinates of the i-th mannequin. It is guaranteed that the origin of the coordinates has no mannequin. It is guaranteed that no two mannequins are located in the same point on the plane.

Output

Print a single real number — the value of the sought angle in degrees. The answer will be considered valid if the relative or absolute error doesn't exceed 10 - 6. 

Examples

Input

2
2 0
0 2


Output

90.0000000000


Input

3
2 0
0 2
-2 2


Output

135.0000000000


Input

4
2 0
0 2
-2 0
0 -2


Output

270.0000000000


Input

2
2 1
1 2


Output

36.8698976458

Note

Solution for the first sample test is shown below: 

<image>

Solution for the second sample test is shown below: 

<image>

Solution for the third sample test is shown below: 

<image>

Solution for the fourth sample test is shown below: 

<image>

Solution (in JAVA):

Solution:
import java.util.*;
public class cf257c {
  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    int n = in.nextInt();
    vec2[] v = new vec2[n];
    for(int i=0; i<n; i++)
      v[i] = new vec2(in.nextInt(),in.nextInt());
    Arrays.sort(v);
    double ans = 0;
    for(int i=0; i<n; i++) {
      double tmp = v[(i+1)%n].angle() - v[i].angle();
      if(tmp > 2*Math.PI) tmp -= 2*Math.PI;
      if(tmp < 0) tmp += 2*Math.PI;
      ans = Math.max(ans,tmp);
    }
    if(ans > 1e-9) ans = 2*Math.PI - ans;
    System.out.printf("%.10f", ans*180./Math.PI);
  }
  static class vec2 implements Comparable<vec2>{
    double x,y;
    vec2(double a, double b) {x=a;y=b;}
    vec2 add(vec2 rhs) {return new vec2(x+rhs.x,y+rhs.y);}
    vec2 sub(vec2 rhs) {return new vec2(x-rhs.x,y-rhs.y);}
    vec2 scale(double s) {return new vec2(x*s,y*s);}
    vec2 midpoint(vec2 rhs) {return new vec2(.5*(x+rhs.x),.5*(y+rhs.y));}
    double dot(vec2 rhs) {return x*rhs.x+y*rhs.y;}
    double cross(vec2 rhs) {return x*rhs.y-y*rhs.x;}//pos->left,neg->right
    double mag() {return Math.sqrt(x*x+y*y);}
    double mag2() {return x*x+y*y;}
    double dist(vec2 rhs) {return sub(rhs).mag();}
    double dist2(vec2 rhs) {return sub(rhs).mag2();}
    vec2 normalize() {return scale(1./mag());} //assumes mag()!=0
    double angleBtwn(vec2 rhs) {return Math.atan2(cross(rhs),dot(rhs));}
    double angle() {return Math.atan2(y,x);}
    vec2 orthoCW() {return new vec2(y,-x);}
    vec2 orthoCCW() {return new vec2(-y,x);}
    vec2 reflect(vec2 n) {return sub(scale(-2*dot(n)));}//n==surface normal
    //[cos(t)  -sin(t)][x] = [x*cos(t)-y*sin(t)   x*sin(t)+y*cos(t)]
    //[sin(t)   cos(t)][y]
    vec2 rotate(double ang) {
      double nx = x*Math.cos(ang) - y*Math.sin(ang);
      double ny = x*Math.sin(ang) + y*Math.cos(ang);
      return new vec2(nx,ny);
    }
    public int compareTo(vec2 v) {
      return Double.compare(angle(), v.angle());
    }
  }
}