#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;

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

double dot(P a, P b) {
	return (a.real()*b.real() + a.imag()*b.imag());
}

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

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

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

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

int main() {
	int m, n;
	while(cin >> m, m) {
		P o(0.0, 0.0);
		vector<P> pm;
		double v, tmp = 0;
		REP(i, m-1) {
			cin >> v;
			tmp += v;
			pm.push_back(P(cos(to_radian(tmp)), sin(to_radian(tmp))));
		}
		pm.push_back(P(cos(to_radian(0.0)), sin(to_radian(0.0))));
		double Sm = 0.0;
		REP(i, m) {
			Sm += area(pm[i], pm[(i+1)%m], o);
		}

		cin >> n;
		vector<P> pn;
		tmp = 0;
		REP(i, n-1) {
			cin >> v;
			tmp += v;
			pn.push_back(P(cos(to_radian(tmp)), sin(to_radian(tmp))));
		}
		pn.push_back(P(cos(to_radian(0.0)), sin(to_radian(0.0))));
		double Sn = 0.0;
		REP(i, n) {
			Sn += area(pn[i], pn[(i+1)%n], o);
		}

		if(LT(Sm, Sn)) {
			cout << 2 << endl;
		} else if(LT(Sn, Sm)) {
			cout << 1 << endl;
		} else {
			cout << 0 << endl;
		}
	}
	return 0;
}