C++ :

#include<iostream>
#include<algorithm>
using namespace std;
int tim[400],day[400]={0};
int zhuanhuan(int x)
{
    int y;
    float m;
    y=(int)(x*24*60*60/366.0);
    m=x*24*60*60/366.0;
    if ((m-y)>=0.5) return y+1;
    else return y;
}
int change(int m,int d)
{
     while(m)
     if(m==1) return d;
     else if(m==2||m==4||m==6||m==8||m==9||m==11) {m--;d+=31;}
     else if(m==3) {m--;d+=29;}
     else {m--;d+=30;} 
}
int main()
{
    int n,m,d,ans;
    cin>>n;
    for (int i=1;i<=n;i++)
        {
             cin>>m>>d;
             day[i]=change(m,d);
         } 
    day[n+1]=367;
    sort(day+1,day+n+2);
    for (int i=1;i<=n+1;i++) tim[i]=day[i]-day[i-1]-1;
    sort(tim+1,tim+n+2);
    ans=zhuanhuan(tim[n+1]);
    cout<<ans<<endl;
    //system("pause");
    return 0;
}