#include <iostream>
#include <bits/stdc++.h>
using namespace std;
char a[10000];
long long  b[10000];
long long  c[10000];
int wieshu(int i)
{
    int k=0,m=i;
    if(i==0) return 1;
    for(;i!=0;k++)
    {
        i/=10;
    }
    if(m<0) {return (k+1);}
    else return k;
}
int main()
{
    int n;
    cin >> n;
    for(int i = 0;i<n;i++)
    {
        cin >> a[i];
        if(a[i]=='a'||a[i]=='b'||a[i]=='c')
        {
            cin  >> b[i] >> c[i];
        }
        else
        {
            b[i] = a[i] - '0';
            a[i] = a[i-1];
            cin >> c[i];
        }
    }
    for(int i = 0;i<n;i++)
    {
        if(a[i] == 'a')
        {
            cout << b[i] << "+" << c[i] << "=" << b[i]+c[i] << endl;
            cout << wieshu(b[i]) + wieshu(c[i]) + wieshu(b[i]+c[i]) + 2 << endl;
        }
        if(a[i] == 'b')
        {
            cout << b[i] << "-" << c[i] << "=" << b[i]-c[i] << endl;
            cout << wieshu(b[i]) + wieshu(c[i]) + wieshu(b[i]-c[i]) + 2 << endl;
        }
        if(a[i] == 'c')
        {
            cout << b[i] << "*" << c[i] << "=" << b[i]*c[i] << endl;
            cout << wieshu(b[i]) + wieshu(c[i]) + wieshu(b[i]*c[i]) + 2 << endl;
        }
    }
    return 0;
}

为啥过不了，只有六十分qwq

各路神仙帮帮本蒟蒻吧qwq