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;
int z[1000001];
void z_algo(string s) {
  z[0] = (int)s.length();
  int i;
  int l, r, k;
  l = 0, r = 0;
  int n = s.length();
  for (i = 1; i < n; i++) {
    if (r < i) {
      l = i;
      r = i;
      while (r < n && s[r - l] == s[r]) r++;
      z[i] = r - l;
      r--;
    } else {
      k = i - l;
      if (z[k] < r - i + 1)
        z[i] = z[k];
      else {
        l = i;
        while (r < n && s[r - l] == s[r]) r++;
        z[i] = r - l;
        r--;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  z_algo(s);
  set<int> se;
  z[0] = 1;
  int fre[27] = {0};
  for (int i = 0; i < s.length(); i++) {
    fre[s[i] - 'a']++;
  }
  se.insert(z[0]);
  if (s.length() <= 2) {
    cout << "Just a legend" << endl;
    return 0;
  }
  for (int i = 1; i < s.length() - 1; i++) {
    if (i + z[i] == (s.length())) {
      if (se.size() > 0 && *(se.rbegin()) >= z[i]) {
        cout << s.substr(0, z[i]) << endl;
        return 0;
      }
      se.insert(z[i]);
    } else
      se.insert(z[i]);
  }
  if (s[0] == s[(int)s.length() - 1] && fre[s[0] - 'a'] > 2) {
    cout << s[0] << endl;
    return 0;
  }
  cout << "Just a legend" << endl;
  return 0;
}