#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>
using namespace std;
int ans[100005],num[100005];
int f91(int n)
{
    if(n<=100)
        return f91(f91(n+11));
    if(n>=101)
        return n-10;
}
int main()
{
    int a,cnt=1;
    while(0==0)
    {
        cin>>a;
        if(a==0)break;
        num[cnt]=a;
        ans[cnt]=f91(a);
        cnt++;
    }
    for(int i=1;i<=cnt-1;i++)
        cout<<"f91("<<num[i]<<") = "<<ans[i]<<endl;
    return 0;
}