#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <stack>
#include <climits>
#include <deque>
#include <bitset>
#include <cassert>
#include <ctime>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const int dy[]={-1,0,1,0},dx[]={0,1,0,-1};
// adjust problem by problem
const double EPS=1e-8;
const double PI=acos(-1.0);
#ifdef __GNUC__
int popcount(int n){return __builtin_popcount(n);}
int popcount(ll n){return __builtin_popcountll(n);}
#endif
#ifndef __GNUC__
template<class T> int popcount(T n){int cnt=0;while(n){if(n%2)cnt++;n/=2;}return cnt;}
#endif
template<class T>int SIZE(T a){return a.size();}
template<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}
template<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}
template<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> void PrintSeq(T &a,int sz){for(int i=0;i<sz;i++){cout<<a[i];if(sz==i+1)cout<<endl;else cout<<' ';}}
bool EQ(double a,double b){return abs(a-b)<EPS;}
void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}
vector<string> split(string str,char del){
  vector<string> res;
  for(int i=0,s=0;i<SIZE(str);i++){
    if(str[i]==del){if(i-s!=0)res.push_back(str.substr(s,i-s));s=i+1;}
    else if(i==SIZE(str)-1){res.push_back(str.substr(s));}
  }
  return res;
}

int N;
int as[3];
int main(){

  cin>>N;
  for(int i=0;i<N;i++)cin>>as[i];
  int maxV=0;
  for(int i=0;i<N;i++)maxV=max(maxV,as[i]);
  vector<int> v;
  for(int j=1;j<=maxV;j++){
    bool ok=true;
    for(int i=0;i<N;i++){
      if(as[i]%j!=0){
        ok=false;
        break;
      }
    }
    if(ok)v.push_back(j);
  }
  for(int i=0;i<(int)v.size();i++)
    cout<<v[i]<<endl;
  
  
  return 0;
}
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;
#define  MAX 100
#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)

int dx[] = {0,1,0,-1};
int dy[] = {-1,0,1,0};
int field[12][12];
char s[12];

void dfs(int x,int y){
	field[y][x] = 0;

	for(int i = 0;i < 4;i++){

		int nx = x + dx[i];
		int ny = y + dy[i];

		if(nx < 0 || ny < 0 || nx >= 12 || ny >= 12){

			continue;

		}else if(field[ny][nx] == 1){
			dfs(nx,ny);
		} 
	}
	
	
}

void setfield(char S[],int y){
	rep(i,12){
		if(S[i] == '1'){
			field[y][i] = 1;
		}else{
			field[y][i] = 0;
		}
	}
}

int countisland(){
	int count = 0;
	rep(y,12){
		rep(x,12){
			if(field[y][x] == 1){
				count++;
				dfs(x,y);
			}
		}
	}
	return count;
}

int main(){

	while(true){
		if(scanf("%s",s) == EOF) break;
		setfield(s,0);
		FOR(i,1,12){
			scanf("%s",s);
			setfield(s,i);
		}
		cout << countisland() << endl;
	}

	return 0;
}