#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define long long lnt;
using namespace std;

const int up=40+1,maxN=1000+5;
bool vis[maxN][maxN];
int node[up][up][up][up],n=1;
struct nodes
{
    int x,y,z,w;
    bool operator < (const nodes& b) const
    {
        if(x!=b.x) return x<b.x;
        else if(y!=b.y) return y<b.y;
        else if(z!=b.z) return z<b.z;
        else if(w!=b.w) return w<b.w;
    }
} no[maxN];

int main()
{
    freopen("xumingshi.in","r",stdin);
    freopen("xumingshi.out","w",stdout);
    int dx,dy,dz,dw,mx,y,z,w,sum,ans=2;

    scanf("%d",&n);//printf("%d",n);
    for(int i=0;i<n;i++)
        scanf("%d %d %d %d",&no[i].x,&no[i].y,&no[i].z,&no[i].w);
    printf("%d\n",n);

    return 0;

}