#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,a,b) for(it i=(it)(a);i<=(it)b;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define moda 998244353LL
#define modb 1000000007LL
#define dai 2500000000000000000LL
#define tyu 2500000000
#define sho -dai
#define eps 1e-14
#define yn(x) cout<<(x ? "Yes":"No")<<endl;
#define YN(x) cout<<(x ? "YES":"NO")<<endl;
using it=long long;
using un=unsigned long long;
using db=long double;
using st=string;
using ch=char;
using bo=bool;
using P=pair<it,it>;
using T=tuple<it,it,it>;
using vi=vector<it>;
using vd=vector<db>;
using vs=vector<st>;
using vc=vector<ch>;
using vb=vector<bo>;
using vp=vector<P>;
using sp=set<P>;
using ss=set<st>;
using si=set<it>;
using vvi=vector<vi>;
using vvd=vector<vd>;
using vvs=vector<vs>;
using vvb=vector<vb>;
using vvc=vector<vc>;
using vvp=vector<vp>;
using vsi=vector<si>;
using vsp=vector<sp>;
using vvsi=vector<vsi>;
using vvsp=vector<vsp>;
using vvvi=vector<vvi>;
using vvvd=vector<vvd>;
using vvvvi=vector<vvvi>;
using mint=modint;
const it dx[4]={0,1,0,-1};
const it dy[4]={1,0,-1,0};

it suu(st s,vi &g,vc &y){
  it n=0;
  rep(i,0,s.size()-1){
    rep(j,0,y.size()-1)
      if(s[i]==y[j]){
        n*=10;
        n+=g[j];
        break;
      }
  }
  return n;
}

int main(){
  it n;cin>>n;
  st a,b,c;
  if(n==1){
    a="ABC";
    b="DEF";
    c="BGCB";
  }
  if(n==2){
    a="AABC";
    b="DEFG";
    c="HIBCJ";
  }
  if(n==3){
    a="spring";
    b="eight";
    c="picnic";
  }
  vc y(0);
  for(ch c:a)y.push_back(c);
  for(ch c:b)y.push_back(c);
  for(ch c:c)y.push_back(c);
  sort(all(y));
  y.erase(unique(all(y)),y.end());
  vi g(10);
  rep(i,0,9)g[i]=i;
  vi mae(y.size(),0);
  do{
    vi k(y.size());
    rep(i,0,y.size()-1)k[i]=g[i];
    if(mae==k)continue;
    else mae=k;
    bo ok=true;
    it n=suu(a,g,y),m=suu(b,g,y),l=suu(c,g,y);
    st d=to_string(n),e=to_string(m),f=to_string(l);
    if(d.size()!=a.size()||e.size()!=b.size()||f.size()!=c.size())ok=false;
    if(n+m!=l)ok=false;
    if(!n||!m||!l)ok=false;
    if(ok){
      cout<<l<<endl;
      return 0;
    }
  }while(next_permutation(all(g)));
}