#include <bits/stdc++.h>
using ll=long long int;
using namespace std;
int fun(ll n){
    int sum=0;
           while(n!=0){
               sum+=(n%10);
               n=n/10;
           }
           return sum;
}
int main()
{
   
    vector<ll>a={8, 8, 3, 8, 6, 8, 1, 8, 2};
    int n=a.size();
    vector<int>p(1000,-1);
    ll ans=-1;
    ll y=-1;
    for(int i=0;i<n;i++){
        ll x=fun(a[i]);
        
        if(p[x]!=-1){
            ans=max(ans,a[i]+p[x]);
            y=x;
        }
        if(a[i]>p[x]){
            p[x]=a[i];
        }
       // cout<<x<<" "<<p[x]<<" "<<ans<<endl;
    }
    map<pair<int,int>,int>p1;
    cout<<ans<<" "<<y<<endl;
    int ans2=0;

        for(int i=0;i<n;i++){
        ll x=fun(a[i]);
        if(p1[{ans-a[i],x}]!=0&&x==y){
            ans2=ans2+p1[{ans-a[i],x}];
        }
       p1[{a[i],x}]++;
       // cout<<x<<" "<<p[x]<<" "<<ans<<endl;
    }
    if(ans==-1){
        ans2=-1;
    }    
    cout<<ans2<<endl;
    return 0;
}