#include<cstdio>
#include<cmath>
#include<algorithm>
#define pi 3.141592653
using namespace std;
struct segm{
    double x1;
    double y1;
    double x2;
    double y2;
}s[550];
struct vec{
    double x;
    double y;
}y[1120],a,b,C;
int n,i,j,k,l,m,ns,v[1120][1120],st[1120],x[1120];
double q;
FILE *f,*g;
double det( vec a, vec b, vec c ){
    return (a.x-c.x)*(b.y-c.y) - (a.y-c.y)*(b.x-c.x);
}
int cmp(vec a,vec b){
    return det( a , b , C ) < 0;
}
int verif( vec a, vec b, vec c, vec d ){
    if( 1LL * det(a,b,c) * det(a,b,d) < 0 && 1LL * det(c,d,a) * det(c,d,b) <0 )
        return 1;
    return 0;
}
void chg(int &a,int &b){
    int aux=a;
    a=b;
    b=aux;
}
int main(){
    f=fopen("laser.in","r");
    g=fopen("laser.out","w");
    fscanf(f,"%d",&n);
    C.x=C.y=0;
    for(i=1;i<=n;i++){
        fscanf(f,"%lf%lf%lf%lf",&s[i].x1,&s[i].y1,&s[i].x2,&s[i].y2);
        y[++m].x=s[i].x1;
        y[m].y=s[i].y1;
        y[++m].x=s[i].x2;
        y[m].y=s[i].y2;
    }
    for(i=1;i<=n;i++){
        fscanf(f,"%d",&st[i]);
    }
    sort(y+1,y+m+1,cmp);
    y[m+1]=y[1];
    for(i=1;i<=m;i++){
        y[i].x=( (y[i].x+y[i+1].x) / 2 ) * 10005;
        y[i].y=( (y[i].y+y[i+1].y) / 2 ) * 10005;
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            a.x=s[i].x1;
            a.y=s[i].y1;
            b.x=s[i].x2;
            b.y=s[i].y2;
            if( verif( a , b , y[j], C ) )
                v[i][j]=1;
        }
        if(st[i]==0)
            v[i][m+1]=0;
        else
            v[i][m+1]=1;
    }
    i=j=1;
    while(i<=n&&j<=m){
        for(k=i;k<=n;k++){
            if(v[k][j])
                break;
        }
        if(k==n+1){
            j++;
            continue;
        }
        for(l=1;l<=m+1;l++){
            chg(v[i][l],v[k][l]);
        }
        for(k=i+1;k<=n;k++){
            if(v[k][j]){
                for(l=j+1;l<=m+1;l++){
                    v[k][l]=( v[k][l] + v[i][l] ) % 2;
                }
            }
        }
        i++;
        j++;
    }
    for(i=n;i>=1;i--){
        for(j=1;j<=m;j++){
            if( v[i][j] ){
                x[j]=v[i][m+1];
                for(l=j+1;l<=m;l++){
                    x[j]=( x[j] + x[l] * v[i][l] ) % 2;
                }
                break;
            }
        }
    }
    for(i=1;i<=m;i++){
        if(x[i])
            ns++;
    }
    fprintf(g,"%d\n",ns);
    for(i=1;i<=m;i++){
        if(!x[i])
            continue;
        q = ( atan2( y[i].y , y[i].x ) * 180 ) / pi;
        if(q<0)
            q+=360;
        fprintf(g,"%.6lf\n",q);
    }

    fclose(f);
    fclose(g);
    return 0;
}