#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for(long long i=0;i<n;++i)
#define rep1(i,n) for(long long i=1;i<=n;++i)
#define rrep(i,n) for(long long i=n-1;i>=0;--i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1.1e18;const lint inf=1.01e9;
constexpr int MOD=1000000007;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }

signed main(){
  string s;cin>>s;
  vector<int> memo(10,0);
  rep(i,s.length())memo[s[i]-'0']++;
  if(memo[4]*memo[6]>0){
    cout<<"Beautiful"<<endl;
  }
  else{
    cout<<"..."<<endl;
  }
  return 0;
  int n,m;cin>>n>>m;
  vector<lint> x(n),y(m);
  rep(i,n)cin>>x[i];
  rep(i,m)cin>>y[i];
  sort(y.begin(),y.end());
  rep(i,n){
    auto it=upper_bound(y.begin(),y.end(),x[i]);
    if(it==y.end())cout<<"Infinity"<<"\n";
    else cout<<*it-x[i]<<"\n";
  }
  return 0;
}