#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <fstream>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toStr(T x) { ostringstream sout; sout << x; return sout.str();}
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-12;
const double PI = acos(-1.0);
const int INF = INT_MAX/10;

#define EQ(x,y) (abs((x)-(y)) < EPS)
#define LT(x,y) ((x)-(y)<=-EPS)

#include <complex>
typedef complex<double> P;
typedef vector<P> vp;

double cross(P a, P b) {
	return (a.real()*b.imag() - a.imag()*b.real());
}

double to_radian(double degree) {
	return degree*PI/180;
}

double area(P a, P b, P c) {
	return abs(cross(c-a, b-a)*0.5);
}

struct state {
	int p;
	double c;
	state(int p, double c) : p(p), c(c) {};
	bool operator<(const state &o)const {
		return o.c<c;
	}
};

int main() {
	int m;
	while(cin >> m, m) {
		vp vm(m);
		int theta = 0.0, tmp;
		REP(i, m-1) {
			cin >> tmp;
			theta += tmp;
			vm[i] = P(cos(to_radian(theta)), sin(to_radian(theta)));
		}
		P p(0, 0);
		double S1 = 0.0;
		REP(i, m-1) {
			S1 += area(p, vm[i], vm[(i+1)%m]);
		}

		int n;
		cin >> n;
		vp vn(n);
		theta = 0.0;
		REP(i, n-1) {
			cin >> tmp;
			theta += tmp;
			vn[i] = P(cos(to_radian(theta)), sin(to_radian(theta)));
		}
		double S2 = 0.0;
		REP(i, n-1) {
			S2 += area(p, vn[i], vn[(i+1)%n]);
		}

		if(EQ(S1, S2)) {
			cout << 0 << endl;
		} else if(LT(S1, S2)) {
			cout << 2 << endl;
		} else {
			cout << 1 << endl;
		}
	}

	return 0;
}