#include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32       = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7        = 1'000'000'007;
constexpr int MOD9        = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&... args) {
    std::cout << head;
    sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
    print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
    for (int i = 0; i < v.size(); i++) {
        std::cout << v[i];
        i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
    }
}
template <class T> void print(std::vector<std::vector<T>> &v) {
    for (int i = 0; i < v.size(); i++) {
        for (int j = 0; j < v[i].size(); j++) {
            std::cout << v[i][j];
            j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
        }
    }
}
void scan() {}
template <class H, class... T> void scan(H &&head, T &&... args) {
    std::cin >> head;
    scan(std::forward<T>(args)...);
}
template <class T> void scan(std::vector<T> &v) {
    for (auto &&i : v) {
        scan(i);
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    vector<string> v(12);
    while (cin >> v[0]) {
        FOR(i, 1, 12) scan(v[i]);
        vector<vector<bool>> vis(12, vector<bool>(12, true));
        int ans        = 0;
        vector<int> dx = {-1, 1, 0, 0};
        vector<int> dy = {0, 0, -1, 1};
        auto exist     = [](int H, int W, int nx, int ny) -> bool {
            if (nx < 0 || W <= nx || ny < 0 || H <= ny)
                return false;
            else
                return true;
        };

        REP(y, 12) {
            REP(x, 12) {
                if (v[y][x] == '1' && vis[y][x] == true) {
                    queue<pair<int, int>> que;
                    que.push({y, x});
                    ans++;
                    while (!que.empty()) {
                        auto now = que.front();
                        que.pop();
                        REP(i, 4) {
                            int nx = now.second + dx[i];
                            int ny = now.first + dy[i];
                            if (exist(12, 12, nx, ny) && v[ny][nx] == '1' &&
                                vis[ny][nx] == true) {
                                que.push({ny, nx});
                            }
                            if (exist(12, 12, nx, ny))
                                vis[ny][nx] = false;
                        }
                    }
                }
                vis[y][x] = false;
            }
        }
        print(ans);
    }

    return 0;
}


Measured memory_bytes: 3132