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 xx[4] = {0, 0, 1, -1};
int yy[4] = {-1, 1, 0, 0};
clock_t time_p = clock();
void Time() {
  time_p = clock() - time_p;
  cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
vector<long long> z_algo(string s) {
  vector<long long> z(s.size(), 0);
  long long l = 0, r = 0, n = s.size();
  for (int i = 1; i < s.size(); i++) {
    if (i > r) {
      l = i;
      r = i;
      while (r < n && s[r - l] == s[r]) {
        r++;
      }
      r--;
      z[i] = r - l + 1;
    } else {
      long long j = i - l;
      if (z[j] < r - i + 1) {
        z[i] = z[j];
      } else {
        l = i;
        while (r < n && s[r - l] == s[r]) {
          r++;
        }
        r--;
        z[i] = r - l + 1;
      }
    }
  }
  return z;
}
void solve() {
  string s;
  cin >> s;
  vector<long long> vec = z_algo(s);
  map<long long, long long> mp;
  long long res = 0, maxx = 0, n = s.size();
  for (int i = 0; i < s.size(); i++) {
    if (n - i == vec[i] && maxx >= vec[i]) {
      res = max(res, vec[i]);
    }
    maxx = max(maxx, vec[i]);
  }
  if (res == 0) cout << "Just a legend";
  for (int i = 0; i < res; i++) {
    cout << s[i];
  }
  cout << endl;
}
int main() {
  long long t = 1;
  while (t--) {
    solve();
  }
  Time();
}