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
/*
 *created by Kraken on 25-04-2020 at 11:56
 */
//package com.kraken.cf.practice;

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

public class B126 {

  public static void main(String[] args) {
    FastReader sc = new FastReader();
    String s = sc.next();
    int n = s.length();
    if (n > 2) {
      int[] pre = new int[n];
      for (int i = 1; i < n; i++) {
        int j = pre[i - 1];
        while (j > 0 && s.charAt(i) != s.charAt(j))
          j = pre[j - 1];
        if (s.charAt(i) == s.charAt(j))
          j++;
        pre[i] = j;
      }
//      System.out.println(Arrays.toString(pre));
      if (pre[n - 1] == 0) {
        System.out.println("Just a legend");
        return;
      }
      for (int i = 0; i < n - 1; i++) if (pre[i] == pre[n - 1]) {
        System.out.println(s.substring(0, pre[n - 1]));
        return;
      }
      int j = pre[pre[n - 1] - 1];
      if (j > 0) {
        System.out.println(s.substring(0, j));
        return;
      }
    }
    System.out.println("Just a legend");
  }

  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;
    }
  }
}
