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 105 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

import java.util.HashMap;
import java.util.Scanner;

public class AncientProphesy {
    public static void main(String asd[])throws Exception
    {
        Scanner in=new Scanner(System.in);
        String s=in.nextLine();
        int n=s.length();int k=0;int m=0;String max="";
        HashMap<String,Integer> hm=new HashMap<String,Integer>();
        HashMap<String,String> hmm=new HashMap<String,String>();
        String a[]={"","31","28","31","30","31","30","31","31","30","31","30","31"};
        for(int i=0;i<n-10+1;i++)
        {
            String r[]=s.substring(i,i+10).split("-");
           // System.out.println(s.substring(i,i+10));
            if(r.length>3 || r.length<3)
                continue;
            else
            {
                if(r[0].length()>=2&&r[1].length()==2 && r[2].length()>=4)
                {
                    String q=r[0].substring(r[0].length()-2,r[0].length());
                    String hh=r[2].substring(0,4);
                    int aa=Integer.parseInt(r[1]);
                    if(aa>=1 && aa<=12)
                    {
                        if(q.compareTo("00")>0&&q.compareTo(a[aa])<=0 && hh.compareTo("2013")>=0 && hh.compareTo("2015")<=0)
                        {
                            String f=q+"-"+r[1]+"-"+hh;
                            if(hm.get(f)==null)
                            {
                                hm.put(f,1);
                            }
                            else 
                                hm.put(f,hm.get(f)+1);
                            if(hm.get(f)>m)
                            {
                                m=hm.get(f);
                                max=f;
                            }
                        }
                    }
                }
            }
        }
        System.out.println(max);
    }
}
