/*CODED BY mahmudulsakib2019
  DATE:-06/3/2024;TIME:-07:39 pm
  BANGALDESH , SYLHET*/

#include <iostream>
#include <cmath>     ///mathematics
#include <vector>    ///array
#include <regex>     ///searching_prefix_suffix
#include <algorithm> ///finding_max_min_from_array
#include <string>    ///string_manipulation
#include <numeric>   ///findin total sum of an array
using namespace std;

int main() {
    string s;
    cin >> s;
    ///int count=0;
    string ch = "leadinguniversity";
    sort(s.begin(), s.end());
    sort(ch.begin(), ch.end());
    /*if(s.size()==ch.size()){
         for(int i=0;i<ch.size();i++){
            for(int j=0;j<s.size();j++){
              if(ch[i]==s[j]){
                count++;
              }
            }
         }
         if (count==17){
            cout<<"Leading University"<<endl;
         }
         else{
            cout <<"Impossible"<<endl;
         }
    }*/
    if(s == ch) {
        cout << "Leading University" << endl;
    } else {
        cout << "Impossible" << endl;
    }
    return 0;
}