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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int p[1000005];
void calc_pass(string pass) {
  int l = 0, r = 0, m, x = pass.size();
  for (int i = 1; i < x; i++) {
    if (i > r) {
      l = r = i;
      while (r < x and pass[r] == pass[r - l]) {
        r++;
      }
      p[i] = r - l;
      r--;
    } else {
      m = i - l;
      if (p[m] < r - i + 1)
        p[i] = p[m];
      else {
        l = i;
        while (r < x and pass[r] == pass[r - l]) {
          r++;
        }
        p[i] = r - l;
        r--;
      }
    }
  }
}
int main() {
  string pass;
  cin >> pass;
  int x = pass.size();
  calc_pass(pass);
  vector<int> ls, ms;
  for (int i = x - 1; i > 0; i--) {
    if (p[i] > 0 and i + p[i] == x) ls.push_back(p[i]);
  }
  int mx = 0;
  for (int i = 1; i < x - 1; i++) {
    if (i + p[i] < x)
      mx = max(mx, p[i]);
    else
      mx = max(mx, p[i] - 1);
  }
  int rs = 0;
  for (int i = 0; i < (int)ls.size(); i++) {
    if (ls[i] <= mx) rs = ls[i];
  }
  if (rs) {
    string ss = pass.substr(0, rs);
    puts(ss.c_str());
  } else
    puts("Just a legend");
}