Problem: Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.

A little later they found a string s, carved on a rock below the temple's gates. Asterix supposed that that's the password that opens the temple and read the string aloud. However, nothing happened. Then Asterix supposed that a password is some substring t of the string s.

Prefix supposed that the substring t is the beginning of the string s; Suffix supposed that the substring t should be the end of the string s; and Obelix supposed that t should be located somewhere inside the string s, that is, t is neither its beginning, nor its end.

Asterix chose the substring t so as to please all his companions. Besides, from all acceptable variants Asterix chose the longest one (as Asterix loves long strings). When Asterix read the substring t aloud, the temple doors opened. 

You know the string s. Find the substring t or determine that such substring does not exist and all that's been written above is just a nice legend.

Input

You are given the string s whose length can vary from 1 to 106 (inclusive), consisting of small Latin letters.

Output

Print the string t. If a suitable t string does not exist, then print "Just a legend" without the quotes.

Examples

Input

fixprefixsuffix


Output

fix

Input

abcdabc


Output

Just a legend

Solution (in JAVA):

Solution:
/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
    long MOD = 1000000007L;
    int INF = 1000000001;
    
    public class Obj implements Comparable<Obj>{
        public int start;
        public int end;
        
        public Obj(int start_, int end_){
            this.start = start_;
            this.end = end_;

        }
        
        public int compareTo(Obj other){
            if (other.start == this.start){
                return this.end - other.end;
            }
            return this.start - other.start;
        }

    }
    
    int[] dx = new int[]{-1, 0, 1, 0, -1, 1, 1, -1};
    int[] dy = new int[]{0, 1, 0, -1, 1, 1, -1, -1};
    
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
        Codechef cf = new Codechef();
        cf.Solve();
	}
	
	public void Solve(){
        MyScanner sc = new MyScanner();
        String s = sc.nextLine();
        char[] arr = s.toCharArray();
        int n = arr.length;
        int[] lps = new int[n];
        int ptn = 0;
        int[] ok = new int[n];
        for (int i = 1; i < n; ++i){
            // System.out.println("i: " + i + " " + arr[i] + " ptn: " + ptn + " " + arr[ptn]);
            if (arr[i] == arr[ptn]){
                lps[i] = ++ptn;
            }else{
                if (ptn != 0){
                    ptn = lps[ptn-1];    
                    i--;
                }
            }
            if (i < n - 1){
                ok[ptn] = 1;
            }
        }
        
        int[] lps2 = new int[n];
        ptn = n - 1;
        int cur = 0;
        // System.out.println();
        for (int i = n - 2; i >= 0; --i){
            // System.out.println(" i: " + i + " " + arr[i] + " ptn: " + ptn + " " + arr[ptn] + " cur: " + cur);
            if (arr[i] == arr[ptn]){
                cur++;
                lps2[i] = cur;
                ptn--;
            }else{
                if (cur != 0){
                    cur = lps2[n - cur];
                    ptn = n - 1 - cur;
                    i++;
                }
            }
        }
        // for (int i = 0; i < n; ++i){
        //     System.out.print(lps[i] + " ");
        //     // System.out.println(i + " " + lps2[i] + " ");
        // }
        // System.out.println();
        // for (int i = 0; i < n; ++i){
        //     System.out.print(lps2[i] + " ");
        //     // System.out.println(i + " " + lps2[i] + " ");
        // }
        // System.out.println();
        if (lps[n-1] == 0){
            System.out.println("Just a legend");
        }else{
            cur = lps[n-1];
            // System.out.println(cur);
            while (cur > 0 && ok[cur] == 0){
                int z = n - cur;
                // System.out.println(cur + " z: " + z + " " + lps2[z]);
                cur = lps2[z];
            }
            if (cur == 0){
                System.out.println("Just a legend");
            }else{
                System.out.println(s.substring(0, cur));
            }
        }
	}
	
	//-----------PrintWriter for faster output---------------------------------
   public static PrintWriter out;
      
   //-----------MyScanner class for faster input----------
   public static class MyScanner {
      BufferedReader br;
      StringTokenizer st;
 
      public MyScanner() {
         br = new BufferedReader(new InputStreamReader(System.in));
      }
 
      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }
 
      int nextInt() {
          return Integer.parseInt(next());
      }
 
      long nextLong() {
          return Long.parseLong(next());
      }
 
      double nextDouble() {
          return Double.parseDouble(next());
      }
 
      String nextLine(){
          String str = "";
      try {
         str = br.readLine();
      } catch (IOException e) {
         e.printStackTrace();
      }
      return str;
      }

   }
}