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.*;
public class cf260b {
  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    String s = in.next().trim();
    ArrayList<String> dates = new ArrayList<String>();
    for(int i=0; i<=s.length() - 10; i++)
      if(isDate(s.substring(i,i+10)))
          dates.add(s.substring(i,i+10));
    Collections.sort(dates);
    String bestDate = "";
    int bestCount = 0;
    int last = 0;
    for(int i=0; i<=dates.size(); i++) {
      if(i == dates.size() || !dates.get(i).equals(dates.get(last))) {
        int count = i-last;
        if(count > bestCount) {
          bestDate = dates.get(last);
          bestCount = count;
        }
        last = i;
      }
    }
    System.out.println(bestDate);
  }
  static boolean isDate(String s) {
    for(int i=0; i<s.length(); i++)
      if(i == 2 || i == 5) {
        if(s.charAt(i) != '-')
          return false;
      }
      else {
        if(!Character.isDigit(s.charAt(i)))
          return false;
      }
    int b = Integer.parseInt(s.substring(0,2));
    int a = Integer.parseInt(s.substring(3,5));
    int c = Integer.parseInt(s.substring(6));
    if(b <= 0) return false;
    if(c < 2013 || c > 2015) return false;
    switch(a) {
      case 1: 
        return b <= 31;
      case 2:
        return b <= 28;
      case 3:
        return b <= 31;
      case 4:
        return b <= 30;
      case 5:
        return b <= 31;
      case 6:
        return b <= 30;
      case 7:
        return b <= 31;
      case 8:
        return b <= 31;
      case 9:
        return b <= 30;
      case 10:
        return b <= 31;
      case 11:
        return b <= 30;
      case 12:
        return b <= 31;
      default:
        return false;
    }
  }
}
