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:
import java.io.*;


import java.util.*;
/*


*/



public class B {
	static FastReader sc=null;

	public static void main(String[] args) {
		sc=new FastReader();
		char line[]=sc.next().toCharArray();
		int z[]=Z(line);
		int n=line.length;
		Map<Integer,Integer> map=new HashMap<>();
		Set<Integer> hash=new HashSet<>();
		int maxRep=0;
		for(int i=n-1;i>=0;i--) {
			int c=map.getOrDefault(z[i], 0);
			map.put(z[i],++c);
			if(i+z[i]==n) {
				hash.add(z[i]);
			}
			maxRep=Math.max(maxRep, z[i]);
			
		}
		//System.out.println(hash.toString());
		int max=-1;
		for(int e:hash) {
			if(map.get(e)>1 || maxRep>e) {
				max=Math.max(e, max);
			}
		}
		//System.out.println(map.toString());
		String s=String.valueOf(line);
		System.out.println(max==-1?"Just a legend":s.substring(0,max));
		
		
		
	}
	static int[] Z(char a[]) {
		int n=a.length;
		int z[]=new int[n];
		int l=0,r=0;
		z[0]=0;
		for(int i=1;i<n;i++) {
			if(r<i) {
				//no need of Z box direct Comparison
				r=l=i;
				while(r<n && a[r]==a[r-l])r++;
				z[i]=r-l;
				r--;
			}
			else {
				//Z box is made now relative index is taken answer is obtained
				int rel_Index=i-l;
				if(z[rel_Index]+i<=r) {
					//direct copy possible
					z[i]=z[rel_Index];
				}
				else {
					//else we move the z box to its left index and recalculate the process
					l=i;
					while(r<n && a[r]==a[r-l])r++;
					z[i]=r-l;
					r--;
				}
			}
		}
		
		return z;
	}
	
	
	
	
		
	
	static int[] reverse(int a[]) {
		ArrayList<Integer> al=new ArrayList<>();
		for(int i:a)al.add(i);
		Collections.sort(al,Collections.reverseOrder());
		for(int i=0;i<a.length;i++)a[i]=al.get(i);
		return a;
	}
	static int[] ruffleSort(int a[]) {
		ArrayList<Integer> al=new ArrayList<>();
		for(int i:a)al.add(i);
		Collections.sort(al);
		for(int i=0;i<a.length;i++)a[i]=al.get(i);
		return a;
	}
	
	
	
	static void print(int a[]) {
		for(int e:a) {
			System.out.print(e+" ");
		}
		System.out.println();
	}
	static void print(char a[]) {
		for(char e:a) {
			System.out.print(e);
		}
		System.out.println();
	}
	
	static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            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; 
        } 
        int[] readArray(int n) {
    		int a[]=new int [n];
    		for(int i=0;i<n;i++) {
    			a[i]=sc.nextInt();
    		}
    		return a;
    	}
    } 
}