#include <bits/stdc++.h>
using namespace std;
const int maxn = 1 << 20;
int used[maxn];
int n;
char res[100][100];
int fre;
int go(int Len) {
  if (Len == 0) return used[n];
  for (int i = 1; i <= n; i++) {
    if (used[i]) {
      for (int k = 2; k <= 8; k *= 2) {
        if ((!used[k * i]) && (k * i <= n)) {
          used[k * i] = fre;
          fre++;
          if (go(Len - 1)) {
            sprintf(res[Len], "lea e%cx, [%d*e%cx]\n", used[k * i] + 'a' - 1, k,
                    used[i] + 'a' - 1);
            return 1;
          }
          fre--;
          used[k * i] = 0;
        }
      }
      for (int j = 1; j <= i; j++) {
        if (used[j]) {
          if (i + j <= n && !used[i + j]) {
            used[i + j] = fre;
            fre++;
            if (go(Len - 1)) {
              sprintf(res[Len], "lea e%cx, [e%cx + e%cx]\n",
                      used[i + j] + 'a' - 1, used[i] + 'a' - 1,
                      used[j] + 'a' - 1);
              return 1;
            }
            fre--;
            used[i + j] = 0;
          }
          for (int k = 2; k <= 8; k *= 2) {
            if (i + k * j <= n && !used[i + k * j]) {
              used[i + k * j] = fre;
              fre++;
              if (go(Len - 1)) {
                sprintf(res[Len], "lea e%cx, [e%cx + %d*e%cx]\n",
                        used[i + k * j] + 'a' - 1, used[i] + 'a' - 1, k,
                        used[j] + 'a' - 1);
                return 1;
              }
              fre--;
              used[i + k * j] = 0;
            }
          }
          for (int k = 2; k <= 8; k *= 2) {
            if (k * i + j <= n && !used[k * i + j]) {
              used[k * i + j] = fre;
              fre++;
              if (go(Len - 1)) {
                sprintf(res[Len], "lea e%cx, [e%cx + %d*e%cx]\n",
                        used[k * i + j] + 'a' - 1, used[j] + 'a' - 1, k,
                        used[i] + 'a' - 1);
                return 1;
              }
              fre--;
              used[k * i + j] = 0;
            }
          }
        }
      }
    }
  }
  return 0;
}
int main() {
  scanf("%d", &n);
  for (int Len = 0; 1; Len++) {
    used[1] = 1;
    fre = 2;
    if (go(Len)) {
      printf("%d\n", Len);
      for (int i = Len; i > 0; i--) printf("%s", res[i]);
      return 0;
    }
  }
  return 0;
}
