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 N = 10e5 + 5;
const long long NN = 105;
const double pi = 3.14159;
const long long MAX = 2e5 + 123;
const long long MOD = 1e9 + 7;
const long long INF = 1000000000000000000;
const long long pw = 31;
void speed() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void hajime() {
  string s;
  cin >> s;
  vector<long long> v(s.size() + 1);
  long long l = 0, r = 0;
  for (long long i = 1; i < s.size(); i++) {
    if (i <= r) v[i] = min(v[i - l], r - i + 1);
    while (i + v[i] < s.size() && s[i + v[i]] == s[v[i]]) v[i]++;
    if (i + v[i] - 1 > r) {
      l = i;
      r = i + v[i] - 1;
    }
    if (i + v[i] == s.size()) {
      for (long long j = i - 1; j > 0; j--) {
        if (v[j] >= v[i]) {
          for (int k = i; k < s.size(); k++) {
            cout << s[k];
          }
          return;
        }
      }
    }
  }
  cout << "Just a legend";
}
int main() {
  long long miyagl = 1;
  for (long long miyagi = 1; miyagi <= miyagl; miyagi++) {
    hajime();
  }
}