#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <queue>
#include <iomanip>

using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ld x;
    cin >> x;
    cout << "25\n";
    cout << fixed << setprecision(16);
    cerr << fixed << setprecision(16);
    vector <ld> v(10);
    ld coeff = 1;
    for (int i = 0; i < 8; i++) {
        coeff /= 2;
    }
    cout << "$1 = $1 * " << coeff << '\n';
    x *= coeff;

    int start = 6;
    ld ans = x / start;
    cout << "$0 = $1 * " << (long double) 1/start << '\n';
    for (int i = start - 1; i >= 2; i--) {
        ans += 1;
        ans *= x;
        ans /= i;
        cout << "$0 = $0 + 1\n";
        cout << "$0 = $0 * $1\n";
        cout << "$0 = $0 * " << (long double) 1/i << '\n';
    }
    ans *= x;
    ans += x + 1;
    cout << "$0 = $0 * $1\n";
    cout << "$0 = $0 + $1\n";
    cout << "$0 = $0 + 1\n";
    for (int i = 0; i < 8; i++) {
        ans *= ans;
        cout << "$0 = $0 * $0\n";
    }
    //cerr << ans;
}

int main() {
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int nrt = 1;
    //cin >> nrt;
    while (nrt--) {
        solve();
    }
    return 0;
}