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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class P260B {
    public static void main(String[] args) {
	InputStream inputStream = System.in;
	OutputStream outputStream = System.out;
	InputReader in = new InputReader(inputStream);
	PrintWriter out = new PrintWriter(outputStream);
	Task solver = new Task();
	solver.solve(in, out);
	out.close();
    }

    static class Task {
	public void solve(InputReader in, PrintWriter out) {
	    final int[] max = new int[] { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
	    String s = in.nextLine();
	    String[] s2 = s.split("-");
	    Map<Date, Integer> mp = new HashMap<>();
	    for (int i = 0; i + 2 < s2.length; i++) {
		if (s2[i + 2].length() >= 4 && s2[i].length() > 0 && s2[i + 1].length() > 0
			&& s2[i + 1].length() <= 2) {
		    int y = Integer.parseInt(s2[i + 2].substring(0, 4));
		    if (2013 <= y && y <= 2015) {
			int m = Integer.parseInt(s2[i + 1]);
			if (1 <= m && m <= 12) {
			    int d = Integer.parseInt(s2[i].substring(s2[i].length() - 2));
			    if (1 <= d && d <= max[m - 1]) {
				Date k = new Date(y, m, d);
				if (mp.containsKey(k))
				    mp.put(k, mp.get(k) + 1);
				else
				    mp.put(k, 1);
			    }
			}
		    }
		}
	    }
	    int cnt = 0;
	    Date md = null;
	    for (Date k : mp.keySet()) {
		if (mp.get(k) > cnt) {
		    cnt = mp.get(k);
		    md = k;
		}
	    }
	    out.println(md.toString());
	}
    }

    static class Date {
	int d;
	int m;
	int y;

	public Date(int a, int b, int c) {
	    y = a;
	    m = b;
	    d = c;
	}

	@Override
	public boolean equals(Object obj) {
	    if (this == obj)
		return true;
	    if (obj == null)
		return false;
	    if (getClass() != obj.getClass())
		return false;
	    Date other = (Date) obj;
	    if (d != other.d)
		return false;
	    if (m != other.m)
		return false;
	    if (y != other.y)
		return false;
	    return true;
	}

	@Override
	public String toString() {
	    return ((d < 10) ? "0" : "") + d + "-" + ((m < 10) ? "0" : "") + m + "-" + y;
	}

	@Override
	public int hashCode() {
	    final int prime = 31;
	    int result = 1;
	    result = prime * result + d;
	    result = prime * result + m;
	    result = prime * result + y;
	    return result;
	}
    }

    static class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
	    reader = new BufferedReader(new InputStreamReader(stream), 32768);
	    tokenizer = null;
	}

	public String next() {
	    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
		try {
		    tokenizer = new StringTokenizer(reader.readLine());
		} catch (IOException e) {
		    throw new RuntimeException(e);
		}
	    }
	    return tokenizer.nextToken();
	}

	public int nextInt() {
	    return Integer.parseInt(next());
	}

	public long nextLong() {
	    return Long.parseLong(next());
	}

	public String nextLine() {
	    try {
		return reader.readLine();
	    } catch (IOException e) {
		throw new RuntimeException(e);
	    }
	}

	public int[] nextIntArray(int n) {
	    int[] arr = new int[n];
	    for (int i = 0; i < n; i++)
		arr[i] = nextInt();
	    return arr;
	}

    }
}
