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.OutputStreamWriter;
import java.io.BufferedWriter;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.Map;
import java.io.IOException;
import java.util.InputMismatchException;
import java.util.TreeMap;
import java.util.Set;
import java.util.function.BiFunction;
import java.util.NoSuchElementException;
import java.math.BigInteger;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Alex
 */
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 {
	class Date implements Comparable<Date>{
		int month;
		int day;
		int year;
		public Date(int day, int month, int year){this.day = day; this.month = month;
			this.year = year;}
		public int compareTo(Date o){
			if (year != o.year) return Integer.compare(year, o.year);
			if (day != o.day) return Integer.compare(day, o.day);
			return Integer.compare(month, o.month);
		}
	}
    public void solve(int testNumber, InputReader in, OutputWriter out){
	    char[] input = in.next().toCharArray();
	    TreeMap<Date, Integer> tm = new TreeMap<>();
	    int[] days = new int[]{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
	    for(int i = 0; i < input.length - 9; i++) {
		    if (Character.isDigit(input[i]) && Character.isDigit(input[i + 1])){
			    int day = Character.getNumericValue(input[i]) * 10 + Character.getNumericValue(input[i+1]);
			    if(input[i + 2] == '-' && Character.isDigit(input[i + 3]) && Character.isDigit(input[i + 4])){
				    int month = Character.getNumericValue(input[i + 3]) * 10 + Character.getNumericValue(input[i + 4]);
				    if(month <= 12 && month > 0 && day > 0 && day <= days[month-1] &&  input[i + 5] == '-' && Character.isDigit(input[i + 6]) && Character.isDigit(input[i + 7]) && Character.isDigit(input[i + 8]) && Character.isDigit(input[i + 9])){
					    int year = Character.getNumericValue(input[i + 6]) * 1000 + Character.getNumericValue(input[i + 7]) * 100 + Character.getNumericValue(input[i + 8]) * 10 + Character.getNumericValue(input[i + 9]);
					    if (year >= 2013 && year <= 2015){
							tm.merge(new Date(day, month, year), 1, Integer::sum);
					    }
				    }
			    }
		    }
	    }
	    int maxoccur = 0;
	    Date maxdate = new Date(-1, -1, -1);
	    for(Map.Entry<Date, Integer> e : tm.entrySet()) {
		    if (e.getValue() > maxoccur){
			    maxoccur = e.getValue();
			    maxdate = e.getKey();
		    }
	    }
	    out.printLine((maxdate.day < 10 ? "0" : "")+maxdate.day + "-" +(maxdate.month < 10 ? "0" : "")+ maxdate.month + "-" + maxdate.year);
    }
}

class InputReader {
	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;

	public InputReader(InputStream stream) {
		this.stream = stream;
	}

	public int read() {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}
	public String readString() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			if (Character.isValidCodePoint(c))
				res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	public boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return isWhitespace(c);
	}

	public static boolean isWhitespace(int c) {
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}
	public String next() {
		return readString();
	}
	public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}
}

class OutputWriter {
	private final PrintWriter writer;

	public OutputWriter(OutputStream outputStream) {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	}
	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();
	}
}

