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

// CodeForces Round #126 B

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class Password {
	
	class Pair implements Comparable<Pair> {
		int pp;  // p[i]
		int ii;  // i
		
		public Pair(int pa, int ia) {
			pp = pa;
			ii = ia;
		}
		
		@Override
		public int compareTo(Pair o) {			
			return this.pp - o.pp;
		}		
	}

	String s;
	int n;
	Pair []prs;
	String t;


	private void readData(BufferedReader bin) throws IOException {
		String sss = bin.readLine();
		s = sss;
		n = s.length();
	}
	
	void printRes() {
		System.out.println(t);
	}
	
	/** from https://stackoverflow.com/questions/13792118/kmp-prefix-table */
	int [] prefixFunction(String s) {
		int n = s.length();				
	    int [] p = new int[s.length()];
	    int j = 0;
	    p[0] = 0;
	    for (int i = 1; i < n; i++) {
	        while (j > 0 && s.charAt(j) != s.charAt(i)) {
	        	j = p[j-1];
	        }
	        if ( s.charAt(j) == s.charAt(i)) {
	            j++;
	        }
	        p[i] = j;
	    }   
	    return p;
	}
	
	void preparePairs(int []p) {
		prs = new Pair[n];
		for (int i=0; i<n; i++) {
			prs[i] = new Pair(p[i], i);
		}
		Arrays.sort(prs);		
	}
	
	int findSameP(int pa) {
		Pair key = new Pair(pa, 0);
		int ia = Arrays.binarySearch(prs, key);
		return ia;
	}
	
	private void calculate() {
		int []p = prefixFunction(s);
		preparePairs(p);
		int nn = n;
		t = "Just a legend";
		while (nn>0) {
			int pn = p[nn-1];
			if (pn == 0) {				
				return;
			}
			int idx = findSameP(pn);
			for (int i=0; i<4; i++) {
				if (idx>0 && prs[idx-1].pp == pn) {
					idx--;
				} else {
					break;
				}
			}
			// TODO
			int idxLast = n - 1;
			for ( ; idx<n && prs[idx].pp == pn; idx++) {
				if (!(prs[idx].ii==0 || prs[idx].ii == idxLast)) {
					t = s.substring(0, pn);
					return;
				}
			}
			nn = pn;
		}		
	}

	public static void main(String[] args) throws IOException {
		// BufferedReader bin = new BufferedReader(new FileReader("cactus.in"));
		BufferedReader bin = new BufferedReader(new InputStreamReader(System.in));
		Password l = new Password();
		if (false) {
			int [] pi = l.prefixFunction("ababaca");
			for (int i : pi) {
				System.out.print(i + " ");
			}
			// ret: 0 0 1 2 3 0 1 
			return;
		}
		l.readData(bin);
		l.calculate();
		l.printRes();
	}
}
