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.io.InputStreamReader;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.Hashtable;
import java.util.ArrayList;
import java.util.Set;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.StringTokenizer;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Lokesh Khandelwal
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		TaskB solver = new TaskB();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskB {
	public void solve(int testNumber, InputReader in, OutputWriter out) {
        String s=in.next();
        int n=s.length();
        ArrayList<String > a=new ArrayList<String>(100000);
        StringBuilder prev=new StringBuilder("");
        for(int i=0;i<n;i++)
        {
            if(s.charAt(i)=='-')
            {
                a.add(prev.toString());
                prev=new StringBuilder("");
            }
            else
            {
                prev.append(s.charAt(i));
            }
        }
        a.add(prev.toString());
       // DebugUtils.print(a);
        String c[]=new String[a.size()];
        int k=0;
        for(String s1 : a)
            c[k++]=s1;
        int days[]={31,28,31,30,31,30,31,31,30,31,30,31};
        Hashtable<String,Integer> hash=new Hashtable<String,Integer>();
        //DebugUtils.print(c);
        for(int i= 0;i<k-2;i++)
        {
            if(c[i].length()>=2&&c[i+1].length()==2&&c[i+2].length()>=4)
            {
                String date=c[i].substring(c[i].length()-2,c[i].length());
                String month=c[i+1];
                String year=c[i+2].substring(0,4);

                int y=Integer.parseInt(year),m=Integer.parseInt(month),d=Integer.parseInt(date);
                //DebugUtils.print(d,m,y);
                if(y>=2013&&y<=2015)
                {
                    if(m>=1&&m<=12)
                    {
                        if(d>=1&&days[m-1]>=d)
                        {

                            String key=date+"-"+month+"-"+year;
                            if(hash.containsKey(key))
                            {
                                hash.put(key,hash.get(key)+1);
                            }
                            else hash.put(key,1);
                        }
                    }
                }
            }
        }
        int max=0;
        String ans="";
        //DebugUtils.print(hash);
        for(String key: hash.keySet())
        {
            if(hash.get(key)>max)
            {
                max=hash.get(key);
                ans=key;
            }
        }
        out.printLine(ans);
	}
}

class InputReader
{
    BufferedReader in;
    StringTokenizer tokenizer=null;

    public InputReader(InputStream inputStream)
    {
        in=new BufferedReader(new InputStreamReader(inputStream));
    }
    public String next()
    {
        try{
            while (tokenizer==null||!tokenizer.hasMoreTokens())
            {
                tokenizer=new StringTokenizer(in.readLine());
            }
            return tokenizer.nextToken();
        }
        catch (IOException e)
        {
            return null;
        }
    }
    }

class OutputWriter {
	private final PrintWriter writer;

	public OutputWriter(OutputStream outputStream) {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	}

	public OutputWriter(Writer writer) {
		this.writer = new PrintWriter(writer);
	}

	public void print(Object...objects) {
		for (int i = 0; i < objects.length; i++) {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		}
	}

	public void printLine(Object...objects) {
		print(objects);
		writer.println();
	}

	public void close() {
		writer.close();
	}
}

