/*

Author: Haze

2024/4/24

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll read() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

#define LD long long

struct point{
    LD x, y;
    point(LD x1 = 0, LD x2 = 0){
        x = x1, y = x2;
    }
    point operator +(const point &a)const{
        return point(x + a.x, y + a.y);
    }
    point operator -(const point &b)const{
        return point(x - b.x, y - b.y);
    }
    friend LD det(point A, point B){
        return A.x * B.y - A.y * B.x;
    }
    friend LD dot(point A, point B){
        return A.x * B.x + A.y * B.y;
    }
};

bool turn_left(point a, point b, point c){
    return det(c - b, b - a) > 0;
}

vector<point> convex_hull(vector<point>a){
    int n = a.size(), cnt = 0;
    if(n < 2)return a;
    vector<point>ret;
    for(int i = 0; i < n; ++ i){
        while(cnt > 1 &&
        turn_left(ret[cnt - 2], a[i], ret[cnt - 1]))
            -- cnt, ret.pop_back();
        ++ cnt;
        ret.push_back(a[i]);
    }
    return ret;
}

double ang(point a, point b){
    return acos(abs(dot(a, b) * 1.0 / sqrt(dot(a, a)) / sqrt(dot(b, b))));
}

void solve() {
    int n = read();
    vector<point>vec(n);
    irep(i, 0, n - 1){
        LD x = read(), y = read();
        vec[i] = {x,y};
    }
    vector<point>con = convex_hull(vec);
    point V = {1, 0};
    int m = con.size();
    double ans = 0;
    irep(i, 0, m - 2){
        int j = i + 1;
        if(con[j].y > con[i].y){
            ans = max(ans, ang({-1, 0}, con[i] - con[j]));
        }
        else ans = max(ans, ang({1, 0}, con[j] - con[i]));
    }
    cout << fixed << setprecision(12) << ans / acos(-1) * 180;
}

int main() {
    // IOS
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}