#include<bits/stdc++.h>
using namespace std;
int month_days[15]={0,31,29,31,30,31,30,31,31,30,31,30,31};
struct node{
    int month,day;
}busy_day[370];
int main()
{
    int n,sum=0,maxn=-1;
    double l;
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        cin>>busy_day[i].month>>busy_day[i].day;
    }
    if (n==0)
    {
        cout<<86400;
        return 0;
    }
    for (int i=1;i<=12;i++)
    {
        for (int j=1;j<=month_days[i];j++)
        {
            for (int k=1;k<=n;k++)
            {
                if (busy_day[k].month==i&&busy_day[k].day==j)
                {
                    if (sum>maxn)
                    {
                        maxn=sum;
                    }
                    sum=0;
                    goto here;
                }
            }
            sum+=86400;
            here:;
        }
    }
    l=maxn*1.0/366;
    if (l-int(l)>=0.5)
    {
        cout<<int(l)+1;
    }
    else
    {
        cout<<int(l);
    }
    return 0;
}

80pts