
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n);
#define REPEAT(i, k, n)     for(int i = (k); i < (k+n); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); ++i)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define MIN(p1,p2)          (((p1)<(p2))?(p1):(p2))
#define MAX(p1,p2)          (((p1)>(p2))?(p1):(p2))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define mp                  make_pair

typedef long long ll;
typedef unsigned long long ull;

#define X real()
#define Y imag()
typedef double D;
typedef complex<D> P;
#define EPS (1e-9)

#ifdef _DEBUG
#define pf printf
#define pr(n) do { cout << #n " = " << (n) << endl; } while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#endif

int dir[][2] = {{1,0},{-1,0},{0,1},{0,-1},{1,1},{-1,1},{1,-1},{-1,-1}};

void doit(vector<string> v){
    int width = v[0].size();
    int height = v.size();
    if(width != 12 || height != 12) throw;
    int count = 0;
    REP(y, height) REP(x, width){
        deque<pair<int,int> > q;
        if(v[y][x] != '1') continue;
        v[y][x] = ' ';
        count++;

        q.push_back(mp(x,y));
        while(!q.empty()){
            int x1 = q.front().first;
            int y1 = q.front().second;
            q.pop_front();
            REP(i,4){
                int nx = x1 + dir[i][0];
                int ny = y1 + dir[i][1];
                if(nx < 0 || nx >= width || ny < 0 || ny >= height) continue;
                if(v[ny][nx] == '1'){
                    v[ny][nx] = ' ';
                    q.push_back(mp(nx,ny));
                }
            }
        }
    }
    cout << count << endl;
}

int main(){
    string s;
    vector<string> v;
    while(getline(cin, s)){
        if(s == ""){
            doit(v);
            v.clear();
            continue;
        }
        v.push_back(s);
    }
    doit(v);
    return 0;
}