#include <bits/stdc++.h>
using namespace std;
int n, a[100000][2], bm;
double pi = 3.14159265359;
double b[100000], max1;
int main() {
  while (scanf("%d", &n) != EOF) {
    bm = 0;
    for (int i = 0; i < n; i++) scanf("%d %d", &a[i][0], &a[i][1]);
    for (int i = 0; i < n; i++)
      if (a[i][1] >= 0) b[bm++] = atan2((double)a[i][1], (double)a[i][0]);
    for (int i = 0; i < n; i++)
      if (a[i][1] < 0)
        b[bm++] = 2 * pi + atan2((double)a[i][1], (double)a[i][0]);
    sort(b, b + bm);
    max1 = -1;
    for (int i = 0; i < bm - 1; i++)
      if (b[i + 1] - b[i] > max1) max1 = b[i + 1] - b[i];
    if (bm >= 2)
      if (b[0] + 2 * pi - b[bm - 1] > max1) max1 = b[0] + 2 * pi - b[bm - 1];
    if (n != 1)
      printf("%.10lf\n", 360 - max1 * 180 / pi);
    else
      printf("%.10lf\n", 0);
  }
  return 0;
}
