starter.cpp

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;

// Type aliases
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;

// Macros
#define endl '\n'
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)

// Constants
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LLINF = 1e18;
const double EPS = 1e-9;

// Fast I/O
void fastIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

// Debug (comment out before submission)
#define debug(x) cerr << #x << " = " << x << endl

void solve() {

int  n;
int temp  = n;
int Rowcount = 0;
int ans = 0;
cin >> n;
vector<vector<int>> a(n, vector<int>(3));

for (size_t i = 0; i < a.size(); i++)
{
    /* code */
    for (size_t j = 0; j < a[i].size(); j++)
    {
        /* code */
        cin >> a[i][j];
    }

    
}



for (size_t i = 0; i < a.size(); i++)
{
    for (size_t j = 0; j < a[i].size(); j++)
    {
        if (a[i][j] !=0 )
        {
            Rowcount++;
        }
        
    }
    if (Rowcount >= 2)
    {
        ans++;
        Rowcount = 0;
    }

    Rowcount= 0;
    
        /* code */
}

cout << ans << endl; 






}




int main() {
    fastIO();
    
    
    // cin >> t;  // Uncomment for multiple test cases
    int t = 1;


    
    while (t--) {
        solve();
    }
    
    return 0;
}