# include <bits/stdc++.h> using namespace std ; queue <int> ln ; int main ( ) { int sum = 0 ; for ( int i = 1 ; i <= 10 ; i ++ ) { while ( ! ln . empty ( ) ) { ln . pop ( ) ; } int cnt = 0 , cur = 0 ; for ( int j = 1 ; j <= 10 ; j ++ ) { int a ; cin >> a ; if ( cnt % 2 == 0 && a == 1 ) { cnt ++ ; cur = j ; } else if ( cnt % 2 == 1 && a == 1 && ln . back ( ) != 1 ) { cnt ++ ; sum += ( j - cur - 1 ) ; } ln . push ( a ) ; } } cout << sum << endl ; return 0 ; }