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.Map;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.FileReader;
import java.io.BufferedWriter;
import java.util.HashMap;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.File;
import java.io.Writer;
import java.util.StringTokenizer;
import java.io.InputStream;

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

class TaskB {
    public void solve(int testNumber, FastScanner s, Output ww) {
        try{
            String str = s.nextString();
            int len = str.length();
            int[] M = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
            Map<String,Integer> mm = new HashMap<String,Integer>();
            String max = "";
            for(int i=0;i+10<=len;i++){
                if(str.charAt(i+2) != '-' || str.charAt(i+5) != '-') continue;
                else{
                    try {
                        int day = Integer.parseInt(str.substring(i, i + 2));
                        int mth = Integer.parseInt(str.substring(i + 3, i + 5));
                        int yr = Integer.parseInt(str.substring(i + 6, i + 10));

                        if (yr < 2013 || yr > 2015) continue;
                        if (mth < 1 || mth > 12) continue;
                        if (day < 1 || day > M[mth - 1]) continue;

                        String temp = str.substring(i, i + 10);

                        if (!mm.containsKey(temp)) mm.put(temp, 1);
                        else mm.put(temp, mm.get(temp) + 1);

                        if (!mm.containsKey(max) || mm.get(temp) > mm.get(max))
                            max = temp;
                    }catch(Exception e){

                    }
                }
            }
            ww.print(max);

        }catch(Exception e){
            e.printStackTrace();
        }
    }
}

class FastScanner {
    BufferedReader s;
    StringTokenizer st;

    public FastScanner(InputStream InputStream){
        st = new StringTokenizer("");
        s = new BufferedReader(new InputStreamReader(InputStream));
    }

    public FastScanner(File f) throws FileNotFoundException{
        st = new StringTokenizer("");
        s = new BufferedReader (new FileReader(f));
    }

    public String nextString() throws IOException{
        if(st.hasMoreTokens())
            return st.nextToken();
        else{
            st = new StringTokenizer(s.readLine());
            return nextString();
        }

    }

}

class Output {

    private final PrintWriter writer;

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

    public Output(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 close() {
        writer.close();
    }


}
