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 double pi = acos(0.0) * 2.0;
const long double eps = 1e-10;
const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0},  {0, -1},
                        {-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
string a, b;
int z1[1000004], z2[100004], c[100005], ans;
void z1algo(string s, int n) {
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z1[i] = min(r - i + 1, z1[i - l]);
    while (i + z1[i] < n && s[z1[i]] == s[i + z1[i]]) ++z1[i];
    if (i + z1[i] - 1 > r) l = i, r = i + z1[i] - 1;
  }
}
void z2algo(string s, int n) {
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z2[i] = min(r - i + 1, z2[i - l]);
    while (i + z2[i] < n && s[z2[i]] == s[i + z2[i]]) ++z2[i];
    if (i + z2[i] - 1 > r) l = i, r = i + z2[i] - 1;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin >> a;
  z1algo(a, a.size());
  int n = a.size();
  int maxp = 0;
  int len = 0;
  for (int i = 1; i < n; i++) {
    if (i + z1[i] == n && z1[i] <= maxp) {
      len = z1[i];
      break;
    }
    maxp = max(maxp, z1[i]);
  }
  if (!min(len, maxp)) {
    cout << "Just a legend\n";
    return 0;
  }
  for (int i = 0; i < min(len, maxp); i++) cout << a[i];
}