#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
long long int power(long long int a, long long int b, long long int m) {
  if (b == 0) return 1;
  if (b == 1) return a % m;
  long long int t = power(a, b / 2, m) % m;
  t = (t * t) % m;
  if (b & 1) t = ((t % m) * (a % m)) % m;
  return t;
}
long long int modInverse(long long int a, long long int m) {
  return power(a, m - 2, m);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n;
  long double angle[100005];
  cin >> n;
  for (long long int i = 1; i <= n; i++) {
    long double x, y;
    cin >> x >> y;
    angle[i] = atan2l(y, x) * (180 / acosl(-1));
  }
  long double ans = 500;
  sort(angle + 1, angle + n + 1);
  for (long long int i = 1; i < n; i++) {
    ans = min(ans, 360 - (angle[i + 1] - angle[i]));
  }
  ans = min(ans, angle[n] - angle[1]);
  cout << fixed << setprecision(12) << ans;
  return 0;
}
