import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum TASK = [
  [],
  ["abc", "def", "bgcb"],
  ["aabc", "defg", "hibcj"],
  ["spring", "eight", "picnic"],
];

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      
      int num;
      int[char] tr;
      foreach (i; 0 .. 3) {
        foreach (c; TASK[N][i]) {
          if (c !in tr) {
            tr[c] = num++;
          }
        }
      }
      auto jss = new int[][3];
      foreach (i; 0 .. 3) {
        foreach (c; TASK[N][i]) {
          jss[i] ~= tr[c];
        }
      }
      
      auto perm = iota(10).array;
      do {
        bool ok = true;
        auto vals = new int[3];
        foreach (i; 0 .. 3) {
          if (perm[jss[i][0]] == 0) {
            ok = false;
            break;
          }
          foreach (j; jss[i]) {
            vals[i] = vals[i] * 10 + perm[j];
          }
        }
        if (ok && vals[0] + vals[1] == vals[2]) {
          writeln(vals[2]);
          break;
        }
      } while (perm.nextPermutation);
    }
  } catch (EOFException e) {
  }
}