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;
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return __builtin_popcount(s);
}
template <class T>
inline T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
string s;
long long z[1000006], res, f[1000006], n;
vector<long long> v;
bool ok[1000006];
long long get(long long i) {
  if (i == 0) return 0;
  long long r = 0;
  while (i < n) {
    r += f[i];
    i += (i & (-i));
  }
  return r;
}
void upd(long long i) {
  while (i > 0) {
    f[i]++;
    i -= (i & (-i));
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> s;
  n = s.size();
  long long l = 0, r = 0;
  for (long long i = 1, _b = n; i < _b; i++) {
    if (i > r) {
      l = r = i;
      while (s[r] == s[r - l] && r < n) r++;
      z[i] = r - l;
      r--;
    } else {
      if (z[i - l] < r - i + 1) {
        z[i] = z[i - l];
      } else {
        l = i;
        while (s[r] == s[r - l] && r < n) r++;
        z[i] = r - l;
        r--;
      }
    }
  }
  for (long long i = 1, _b = n; i < _b; i++) {
    if (get(z[i]) && z[n - z[i]] == z[i]) {
      res = max(res, z[i]);
    }
    upd(z[i]);
  }
  if (res == 0)
    cout << "Just a legend";
  else {
    for (long long i = 0, _b = res; i < _b; i++) cout << s[i];
  }
  return 0;
}