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;
const long long MAX = 123456789;
const long long inf = 1234567890;
const double EPS = 1e-10;
const double PI = 2 * asin(1.0);
const long long mod = 1e9 + 7;
inline int cmp(double x, double y = 0, double tol = EPS) {
  return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
int z[1000010];
void z_algo(string s) {
  int L = 0, R = 0;
  for (int i = 1; i < ((int)s.size()); i++) {
    if (i > R) {
      L = R = i;
      while (R < ((int)s.size()) && s[R - L] == s[R]) R++;
      z[i] = R - L;
      R--;
    } else {
      int k = i - L;
      if (z[k] < R - i + 1)
        z[i] = z[k];
      else {
        L = i;
        while (R < ((int)s.size()) && s[R - L] == s[R]) R++;
        z[i] = R - L;
        R--;
      }
    }
  }
}
int main() {
  string s;
  cin >> s;
  z_algo(s);
  set<int> tamanhos;
  for (int i = 0; i < ((int)s.size()); ++i) {
    if (z[i] == ((int)s.size()) - i) tamanhos.insert(z[i]);
  }
  set<int>::reverse_iterator it = tamanhos.rbegin();
  while (it != tamanhos.rend()) {
    for (int i = 1; i < ((int)s.size()); ++i) {
      if (z[i] == (*it)) {
        if (i + (*it) != ((int)s.size())) {
          cout << s.substr(0, (*it)) << endl;
          return 0;
        }
      }
      if (z[i] > (*it)) {
        cout << s.substr(0, (*it)) << endl;
        return 0;
      }
    }
    it++;
  }
  cout << "Just a legend\n";
}