#include <bits/stdc++.h>   using namespace std;   int n, ans, reg[26] = {1};   char s[100][100];   bool dfs(int dep) {     if (reg[dep] == n) return true;     if (dep >= ans || reg[dep] > n) return false;     ++dep;     for (int i = -1; i < (dep); ++i)       for (int j = 0; j < (dep); ++j) {         int ii = i;         if (ii == -1) ii = 25;         for (int k = 1; k <= 8; k <<= 1) {           reg[dep] = reg[ii] + k * reg[j];           if (dfs(dep)) {             sprintf(s[dep],  lea e%cx, [e%cx + %d*e%cx] , dep +  a , ii +  a , k,                     j +  a );             return true;           }         }       }     return false;   }   int main() {     scanf( %d , &n);     for (ans = 0; !dfs(0); ++ans)       ;     printf( %d n , ans);     for (int i = 1; i < (ans + 1); ++i) printf( %s n , s[i]);     return 0;   }   