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
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class Password {
  private static int p = 31;
  private static int m = 1000000009;

  public static void main(String[] args) throws Exception {
    PrintWriter writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    Solution solution = new Solution(new InputReader(), writer);
    solution.solve();
    writer.close();
  }

  public static class Solution {
    private InputReader in;
    private PrintWriter writer;

    private int n;
    private long[] prefixHashes;
    private long[] pPowers;

    Solution(InputReader input, PrintWriter writer) {
      this.in = input;
      this.writer = writer;
    }

    void solve() throws Exception {
      String s = in.readString();
      n = s.length();
      prefixHashes = prefixHashes(s, p, m);
      long[] suffixHashes = new long[n + 1];
      for (int i = 0; i <= n; i++) {
        suffixHashes[i] = mod(prefixHashes[n] - prefixHashes[n - i]);
      }
      pPowers = pPowers(n + 1, p, m);

      List<Integer> possibleLengths = new ArrayList<>();

      for (int i = 0; i <= n; i++) {
        if (mod(pPowers[n - i] * prefixHashes[i]) == suffixHashes[i]) {
          possibleLengths.add(i);
        }
      }

      int min = 0;
      int max = possibleLengths.size() - 1;

      while (min < max) {
        int mid = (min + max + 1) / 2;
        if (possible(possibleLengths.get(mid))) {
          min = mid;
        } else {
          max = mid - 1;
        }
      }

      if (possibleLengths.get(min) == 0) {
        writer.print("Just a legend");
        return;
      }

      writer.print(s.substring(0, possibleLengths.get(min)));
    }

    boolean possible(int length) {
      long prefixHash = prefixHashes[length];
      for (int i = 1; i < n - length; i++) {
        long hash = mod(prefixHashes[i + length] - prefixHashes[i]);
        if (mod(prefixHash * pPowers[i]) == hash) {
          return true;
        }
      }
      return false;
    }

    long mod(long value) {
      return (value + m) % m;
    }

    long[] prefixHashes(String s, int p, int m) {
      int n = s.length();
      long[] h = new long[n + 1];
      long pPow = 1;
      for (int i = 0; i < n; i++) {
        h[i + 1] = (h[i] + (s.charAt(i) - 'a' + 1) * pPow) % m;
        pPow = (pPow * p) % m;
      }
      return h;
    }

    long[] pPowers(int n, int p, int m) {
      long[] pPowers = new long[n];
      long pPow = 1;
      pPowers[0] = pPow;
      for (int i = 1; i < n; i++) {
        pPow = (pPow * p) % m;
        pPowers[i] = pPow;
      }
      return pPowers;
    }
  }

  public static class InputReader {
    BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");

    String readString() throws Exception {
      while (!st.hasMoreTokens()) {
        st = new StringTokenizer(stdin.readLine());
      }
      return st.nextToken();
    }

    long readLong() throws Exception {
      return Long.parseLong(readString());
    }

    int readInt() throws Exception {
      return Integer.parseInt(readString());
    }
  }
}
