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> Z_Algorithm(const string& s) {
  int n = s.size();
  vector<int> Z(n);
  int L = 0, R = 0;
  for (int i(1); i < (n); ++i) {
    if (R > i) {
      if (Z[i - L] + i >= R) {
        L = i;
        Z[i] = R - i;
        for (int j(R); j < (n); ++j) {
          if (s[j] == s[j - i]) {
            ++Z[i];
          } else
            break;
        }
        R = i + Z[i] - 1;
      } else {
        Z[i] = Z[i - L];
      }
    } else {
      L = i;
      for (int j(i); j < (n); ++j) {
        if (s[j] == s[j - i]) {
          ++Z[i];
        } else
          break;
      }
      R = L + Z[i] - 1;
    }
  }
  return Z;
}
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 randomString() {
  int n = 10 + rand() % 4;
  string str(n, '-');
  for (int i = 0; i < (n); ++i) str[i] = rand() % 3 + 'a';
  return str;
}
int main() {
  string s;
  cin >> s;
  vector<int> Z = Z_Algorithm(s);
  int n = s.size();
  int bestInner = 0;
  vector<bool> T(n + 1), R(n + 1);
  for (int i = 0; i < (Z.size()); ++i) {
    if (i + Z[i] == n) {
      R[Z[i]] = 1;
      bestInner = max(bestInner, Z[i] - 1);
    } else
      bestInner = max(bestInner, Z[i]);
  }
  int best = 0;
  for (int i = 0; i < (R.size()); ++i)
    if (R[i] && bestInner >= i) best = i;
  if (best) {
    cout << s.substr(0, best) << endl;
  } else {
    cout << "Just a legend" << endl;
  }
  return 0;
}