#include <iostream>
using namespace std;
int main()
{
	int a,j,sum=0;
	cin>>a;
	for(int i=1;i<=a;i++)
	{
		cin>>j;
		int g=j%10;
		int s=j/10%10;
		int b=j/100%10;
		int q=j/1000;
		if(g-q-s-b>0)
		{
			sum++;
		}
	}
    cout<<sum;
}

#include <iostream>
using namespace std;
int n, cnt;
char c[4];
int main()
{
	cin >> n;
	while(n --)
	{
		cin >> c;
		if(c[3] - c[2] - c[1] - c[0] > -96)
			cnt ++;
	}
	cout << cnt << endl;
	return 0;
}

#include #include using namespace std; int main() { int n,shu,sf,sum=0; cin>>n; for(int i=n;i!=0;i--) { cin>>shu; sf=shu%10-shu/1000%10-shu/100%10-shu/10%10; if (sf>0) { sum+=1; } } cout<<sum<<endl; return 0; }

#include <iostream>
using namespace std;
int n,j,g,s,b,q,m;
int main()
{
    cin>>n;
    for(int i=0;i<=n;++i)
    {
        cin>>j;
        g=j%10;
        s=j/10%10;
        b=j/100%10;
        q=j/1000;
        if(g-q-b-s>0)
        {
            m+=1;
        }
    }
    cout<<m;
    


    return 0;
}

#include <iostream>
using namespace std;
int main()
{
    int n, num, x=0, ge, shi, bai, qian;
    cin >> n;
    for (int i=0; i<n; i++){
        cin >> num;
        qian = num/1000;
        bai = num/100%10;
        shi = num/10%10;
        ge = num%10;
        if ((ge-qian-bai-shi)>0) x++;
    }
    cout << x << endl;
    return 0;
}

#include <iostream>
using namespace std;
int main()
{
    int n, num, x=0, ge, shi, bai, qian;
    cin >> n;
    for (int i=0; i<n; i++){
        cin >> num;
        qian = num/1000;
        bai = num/100%10;
        shi = num/10%10;
        ge = num%10;
        if ((ge-qian-bai-shi)>0) x++;
    }
    cout << x << endl;
    return 0;
}

#include <iostream>
#include <stack>
#include <cmath>
#include <vector>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
int jian(int x)
{
	int ge = x % 10;
	int shi = x % 100 / 10;
	int bai = x % 1000 / 100;
	int qian = x / 1000;
	if(ge - shi - bai - qian > 0)
	{
		return 0;
	}
	return -1;
}
signed main()
{
	int n;
	cin >> n;
	int cnt = 0;
	for(int i = 1; i <= n; i++)
	{
		int a = 0;
		cin >> a;
		if(jian(a) == 0)
		{
			cnt++;
		}
	}
	printf("%lld\n", cnt); 
	return 0;
}

#include<iostream>
#include<iomanip>
#include<math.h>
using namespace std;
int main()
{
    int n;  
    cin >> n;
    int a;
    int g,s,b,q;
    int c=0;
    for(int i=0;i<n;i++)
    {
    	cin>>a;
    	g=a%10;
    	s=a/10%10;
    	b=a/100%10;
    	q=a/1000;
    	if((g-s-b-q)>0)
    	{
    		c++;
		}
	}cout<<c;
}

#include <iostream>
using namespace std;
int main()
{
    int n, num, x=0, ge, shi, bai, qian;
    cin >> n;
    for (int i=0; i<n; i++){
        cin >> num;
        qian = num/1000;
        bai = num/100%10;
        shi = num/10%10;
        ge = num%10;
        if ((ge-qian-bai-shi)>0) x++;
    }
    cout << x << endl;
    return 0;
}

#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include<bits/stdc++.h> #define ll long long const int N=1e5+10; const int INF=0x3f3f3f3f; using namespace std; int main(){ int n,sum=0,g,s,b,q,c; cin>>n; for(int i=0;i<n;i++){ cin>>c; g=c%10; s=c/10%10; b=c/100%10; q=c/1000; if((g-q-b-s)>0){ sum++; } }cout<<sum; return 0; }