#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <ctime>
#include <random>
#include <cassert>

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

void solve() {
    ld x, ans = 0;
    cin >> x;
    ld coeff = 1;
    int cnt = 23;
    cout << "25\n";
    for (int i = 0; i < cnt; i++) {
        coeff /= 2;
    }
    x *= coeff;
    cout << fixed << setprecision(20) << "$1 = $1 * " << coeff << '\n';
    ans = x + 1;
    cout << "$0 = $1 + 1\n";
    for (int i = 0; i < cnt; i++) {
        ans *= ans;
        cout << "$0 = $0 * $0\n";
    }
    cerr << ans;
}

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