#include <bits/stdc++.h>
using namespace std;
const int N = 514;
int n, as = 12, v[N] = {1}, r1[N], r2[N], p[N];
void dfs(int x) {
  if (x == as) {
    if (v[x] == n) {
      printf("%d\n", as);
      for (int i = (1); i <= (as); i++) {
        printf("lea e%cx, [", i + 'a');
        if (r1[i] != 'a' - 1) printf("e%cx + ", r1[i]);
        if (p[i]) printf("%d*", p[i]);
        printf("e%cx]\n", r2[i]);
      }
      exit(0);
    }
    return;
  }
  for (int i = (0); i <= (x); i++)
    for (int j = (-1); j <= (x); j++)
      for (int k = (0); k <= (3); k++) {
        int y = v[i], z = 0;
        if (j >= 0) z = v[j];
        v[x + 1] = y * (1 << k) + z;
        if (v[x + 1] <= v[x] || v[x + 1] > n) continue;
        p[x + 1] = 1 << k;
        r1[x + 1] = j + 'a', r2[x + 1] = i + 'a';
        dfs(x + 1);
      }
}
int main() {
  scanf("%d", &n);
  for (int i = (0); i <= (11); i++) as = i, dfs(0);
}
