#include <bits/stdc++.h>

using namespace std;

const double eps = 1e-8, PI = 3.14159265358979323846264338327950288;
const int Nmax = 1030;

int X1, Y1, X2, Y2, i, n, j, p[Nmax], xr, m;
bitset<Nmax> a[Nmax];
double angle1, angle2;
pair<double, double> A[Nmax];
vector<double> ans, v, bisect;

double get_angle(int x, int y)
{
    double angle = atan2(y,x);
    if(angle < 0) angle += 2*PI;
    return angle;
}

bool intersect(double x, double y, double z)
{
    if(y-x > PI) return (z<x+eps || z>y-eps);
    return (x<z+eps && z-eps<y);
}

int main()
{
    freopen("laser.in", "r", stdin);
    freopen("laser.out", "w", stdout);

    scanf("%d", &n);

    for(i=1; i<=n; ++i)
    {
        scanf("%d%d%d%d", &X1, &Y1, &X2, &Y2);

        angle1 = get_angle(X1, Y1);
        angle2 = get_angle(X2, Y2);
        if(angle1 > angle2) swap(angle1, angle2);
        A[i] = {angle1, angle2};
        v.push_back(angle1);
        v.push_back(angle2);
    }

    sort(v.begin(), v.end());

    m = v.size();
    for(i=0; i<m-1; ++i)
        bisect.push_back( (v[i]+v[i+1])/2 );

    bisect.push_back( ( v[0]+2*PI + v[m-1] )/2 );
    if(bisect.back() > 2*PI) bisect.back() -= 2*PI;

    for(i=1; i<=n; ++i)
    {
        for(j=1; j<=m; ++j)
            a[i][j] = intersect(A[i].first, A[i].second, bisect[j-1]);
        scanf("%d", &xr);
        a[i][m+1] = xr;
    }

    for(i=1; i<=n; ++i)
    {
        for(j=1; j<=m+1; ++j)
            if(a[i][j]) break;

        if(j==m+2) continue;
        p[i] = j;

        for(j=1; j<=n; ++j)
        if(i!=j && a[j][p[i]])
            a[j] ^= a[i];
    }

    for(i=1; i<=n; ++i)
    if(p[i] && a[i][m+1])
        ans.push_back(bisect[p[i]-1]);

    printf("%d\n", ans.size());
    for(auto x : ans)
        printf("%.6lf\n", x/PI*180);

    return 0;
}