#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }



int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};



vector<string> vs;

string str;

int res = 0;
bool seen[15][15];

void dfs(int i, int j) {
    seen[i][j] = true;
    for (int k = 0; k < 4; ++k) {
        int ni = i + dx[k], nj = j + dy[k];
        if (ni < 0 || ni >= 12 || nj < 0 || nj >= 12) continue;
        if (seen[ni][nj]) continue;
        if ( vs[ni][nj] == '1' ) dfs(ni, nj);
    }
}

int main() {
    vs.clear();
    while (getline(cin, str)) {
        vs.PB(str);
        while ( getline(cin, str) ) {
            if (str == "") {
                break;
            }
            vs.PB(str);
        }
        
        res = 0;
        memset(seen, 0, sizeof(seen));
        for (int i = 0; i < 12; ++i) {
            for (int j = 0; j < 12; ++j) {
                if ( !seen[i][j] && vs[i][j] == '1') {
                    dfs(i, j);
                    ++res;
                }
            }
        }
        
        cout << res << endl;
        vs.clear();
    }
    
    return 0;
}
