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;
vector<int> prefix_function(string s) {
  int n = (int)s.length();
  vector<int> pi(n);
  for (int i = 1; i < n; ++i) {
    int j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) ++j;
    pi[i] = j;
  }
  return pi;
}
vector<int> z_function(string s) {
  int n = (int)s.length();
  vector<int> z(n);
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
string inp;
int main() {
  cin >> inp;
  int len = inp.length();
  vector<int> p = prefix_function(inp);
  vector<int> z = z_function(inp);
  set<int> Map1;
  set<int> Map2;
  for (int i = 0; i < len; i++) {
    if (z[i] > 0 && z[i] + i == len) {
      Map2.insert(z[i]);
    }
    if (z[i] - 1 > 0 && z[i] + i == len) {
      Map1.insert(z[i] - 1);
    }
    if (z[i] > 0 && z[i] + i < len) {
      Map1.insert(z[i]);
    }
  }
  int mx = 0;
  for (set<int>::iterator it = Map2.begin(); it != Map2.end(); it++) {
    int k = *it;
    set<int>::iterator it1 = Map1.upper_bound(k);
    set<int>::iterator it2 = Map1.find(k);
    if (it1 != Map1.end()) {
      mx = max(mx, *it);
    }
    if (it2 != Map1.end()) {
      mx = max(mx, *it);
    }
  }
  if (mx == 0) {
    cout << "Just a legend" << endl;
  } else {
    cout << inp.substr(0, mx) << endl;
  }
  return 0;
}