#include<bits/stdc++.h>
using namespace std;
int n,a[1000001];
int F91(int n){
    if(n<=100)
        n=F91(F91(n+11));
    if(n>=101)
        n=n-10;
    return n;
}
int main()
{
    int cnt=2;
    cin>>n;a[1]=n;
    while(n!=0)
    {
    cin>>n;
    a[cnt]=n;
    cnt++;
    }
    for(int i=1;i<cnt-1;i++)
    cout<<"f91("<<a[i]<<")"<<" = "<<F91(a[i])<<endl;
    return 0;
}
//我是小牛逼，越来越牛逼！

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll f91(ll n)
{
    if(n<101) return f91(f91(n+11));
    return n-10;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n;
    while(1)
    {cin>>n; if(n) cout<<'f'<<91<<'('<<n<<')'<<' '<<'='<<' '<<f91(n)<<endl; else break;}
    return 0;
}