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.*;
import java.io.*;

public class B260
{
    static int[] numdays=new int[]{31,28,31,30,31,30,31,31,30,31,30,31};

    public static void main(String[] args) throws IOException
    {
        Scanner sc=new Scanner(System.in);
        while(sc.hasNext())
        {
            String s=sc.next();
            Vector<String> v=new Vector<String>();
            for(int i=0;i+10<=s.length();i++)
            {
                String sub=s.substring(i,i+10);
                if(sub.charAt(2)!='-'||sub.charAt(5)!='-')
                    continue;
                boolean ok=true;
                for(int j=0;j<sub.length();j++)
                    if(j!=2 && j!=5 && (sub.charAt(j)<'0' || sub.charAt(j)>'9'))
                        ok=false;
                if(!ok)
                    continue;
                try
                {
                    int dd=Integer.parseInt(sub.substring(0,2)); // " 9"
                    int mm=Integer.parseInt(sub.substring(3,5));
                    int yy=Integer.parseInt(sub.substring(6,10));
                    if(mm>=1&&mm<=12 && numdays[mm-1]>=dd && dd>=1 && yy>=2013 && yy<= 2015)
                        v.add(sub);
                }
                catch(Exception e)
                {
                }
            }
            Collections.sort(v);
            //for(int i=0;i<v.size();i++)
            //    System.out.println("> "+v.get(i));
            String best="?";
            int numbest=-1;
            for(int i=0;i<v.size();i++)
            {
                int j=i;
                while(j+1<v.size()&&v.get(j+1).equals(v.get(i)))
                    j++;
                if(j-i>numbest)
                {
                    best=v.get(i);
                    numbest=j-i;
                }
                //System.out.println("["+i+", "+j+"]");
                i=j;
            }
            System.out.println(best);
        }
    }
}