#include <bits/stdc++.h>
using namespace std;
string cmd[256];
int a[256];
string ex(int id) {
  string ans = "eax";
  ans[1] += id;
  return ans;
}
bool dfs(int to, int now, int mx) {
  if (a[now] > to) return false;
  if (now == mx) {
    if (a[now] == to) {
      cout << mx << endl;
      for (int i = 0; i < now; i++) cout << cmd[i] << endl;
      return true;
    } else
      return false;
  }
  for (int i = 0; i < now + 1; i++) {
    for (int k = 1; k <= 8; k *= 2) {
      a[now + 1] = a[i] * k;
      if (a[now + 1] > to) continue;
      if (now + 1 == mx && a[now + 1] != to) continue;
      cmd[now] =
          "lea " + ex(now + 1) + ", [" + (char)(k + '0') + "*" + ex(i) + "]";
      if (dfs(to, now + 1, mx)) return true;
    }
  }
  for (int i = 0; i < now + 1; i++)
    for (int j = 0; j < now + 1; j++)
      for (int k = 1; k <= 8; k *= 2) {
        a[now + 1] = a[i] + a[j] * k;
        if (a[now + 1] > to) continue;
        if (now + 1 == mx && a[now + 1] != to) continue;
        cmd[now] = "lea " + ex(now + 1) + ", [" + ex(i) + " + " +
                   (char)(k + '0') + "*" + ex(j) + "]";
        if (dfs(to, now + 1, mx)) return true;
      }
  return false;
}
int main() {
  int n;
  cin >> n;
  a[0] = 1;
  for (int i = 0; i <= n; i++) {
    if (dfs(n, 0, i)) {
      break;
    }
  }
  return 0;
}
