CodeForces

A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is a string that only consists of digits and characters "-".

We'll say that some date is mentioned in the Prophesy if there is a substring in the Prophesy that is the date's record in the format "dd-mm-yyyy". We'll say that the number of the date's occurrences is the number of such substrings in the Prophesy. For example, the Prophesy "0012-10-2012-10-2012" mentions date 12-10-2012 twice (first time as "0012-10-2012-10-2012", second time as "0012-10-2012-10-2012").

The date of the Apocalypse is such correct date that the number of times it is mentioned in the Prophesy is strictly larger than that of any other correct date.

A date is correct if the year lies in the range from 2013 to 2015, the month is from 1 to 12, and the number of the day is strictly more than a zero and doesn't exceed the number of days in the current month. Note that a date is written in the format "dd-mm-yyyy", that means that leading zeroes may be added to the numbers of the months or days if needed. In other words, date "1-1-2013" isn't recorded in the format "dd-mm-yyyy", and date "01-01-2013" is recorded in it.

Notice, that any year between 2013 and 2015 is not a leap year.

Input

The first line contains the Prophesy: a non-empty string that only consists of digits and characters "-". The length of the Prophesy doesn't exceed 10⁵ characters.

Output

In a single line print the date of the Apocalypse. It is guaranteed that such date exists and is unique.

Examples

Input

777-444---21-12-2013-12-2013-12-2013---444-777

Output

13-12-2013

字符串暴力匹配，没有算法，直接每次读20个字符，对字符进行分析，每次向前移动一个字符。复杂度 10^4*12 不会超时，比较简单

#include<iostream>
#include<queue>
#include<algorithm>
#include<set>
#include<cmath>
#include<vector>
#include<map>
#include<stack>
#include<bitset>
#include<cstdio>
#include<cstring>
//---------------------------------Sexy operation--------------------------//

#define cini(n) scanf("%d",&n)
#define cinl(n) scanf("%lld",&n)
#define cinc(n) scanf("%c",&n)
#define cins(s) scanf("%s",s)
#define coui(n) printf("%d",n)
#define couc(n) printf("%c",n)
#define coul(n) printf("%lld",n)
#define speed ios_base::sync_with_stdio(0)
#define file  freopen("input.txt","r",stdin);freopen("output.txt","w",stdout)
//-------------------------------Actual option------------------------------//

#define Swap(a,b) a^=b^=a^=b
#define Max(a,b) a>b?a:b
#define Min(a,b) a<b?a:b
#define mem(n,x) memset(n,x,sizeof(n))
#define mp(a,b) make_pair(a,b)
//--------------------------------constant----------------------------------//

#define INF  0x3f3f3f3f
#define maxn  100010
#define esp  1e-9
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
//------------------------------Dividing Line--------------------------------//
string s;
char temp[15];
int month[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
map<string,int> mp;
int main()
{
    speed;
    cin>>s;
    int len = s.size();
    for(int i=0; i<=len-10; i++)
    {
        for(int j =0; j<10; j++) temp[j]=s[j+i];
        temp[10]='';
        if(temp[6]!='2'||temp[7]!='0'|| temp[8]!='1')
            continue;
        if(temp[9] != '3'&&temp[9]!= '4'&&temp[9]!='5')
            continue;
        if(temp[2]!='-'||temp[5]!='-')
            continue;
        if(!isdigit(temp[0])||!isdigit(temp[1])||!isdigit(temp[3])||!isdigit(temp[4])||!isdigit(temp[6])||!isdigit(temp[7])||!isdigit(temp[8])||!isdigit(temp[9]))
            continue;
        int mon=(temp[3]-'0')*10+temp[4]-'0';
        if(mon <=0||mon>12)continue;
        int day =(temp[0]-'0')*10+temp[1]-'0';
        if(day>month[mon]||day<=0)continue;
        mp[temp]++;
    }
    int maxx=0;
    string ans;
    for(auto xxxx=mp.begin(); xxxx!=mp.end(); xxxx++)
    {
        if(maxx<(xxxx->second))
        {
            maxx=xxxx->second;
            ans=xxxx->first;
        }
    }
    cout<<ans<<endl;
    return 0 ;
}