#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using LD = long double;
using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pld = pair<LD, LD>;
const LD pi = acosl(-1.0L);
inline int sq(const int a) { return a * a; }
inline LD length(const pii &point) {
  return sqrtl(sq(point.first) + sq(point.second));
}
inline LD angle(const pii &point) {
  const LD x = point.first, y = point.second;
  if (y >= 0) {
    return acosl((x) / length(point));
  }
  return 2 * pi - acosl((x) / length(point));
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(6);
  cout.flags(ios::fixed);
  int n;
  cin >> n;
  vector<pii> points(n);
  for (pii &point : points) {
    cin >> point.first >> point.second;
  }
  sort(begin(points), end(points), [](const pii &point1, const pii &point2) {
    return angle(point1) < angle(point2);
  });
  LD min_angle = 2 * pi;
  for (int i = 0; i < n - 1; ++i) {
    min_angle =
        min(min_angle, 2 * pi - abs(angle(points[i]) - angle(points[i + 1])));
  }
  min_angle = min(min_angle, abs(angle(points[0]) - angle(points[n - 1])));
  cout << min_angle * 180 / pi;
}
