#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;

string s;

int changei(string buf){
	int res;
	stringstream ss;
	ss << buf;
	ss >> res;
	return res;
}

int main(){
	while (getline(cin, s)){
		if (s == "0")break;
		stringstream ss;
		string buf;
		ss << s;
		int sum = 0;
		int co = 0;
		while (ss >> buf){
			int a = changei(buf);
			if (a > 10)a = 10;
			if (a == 1){
				co++;
			}
			else{
				sum += a;
			}
		}
		int k = sum;
		REP(i, co + 1){
			int a = k + 1 * i + 11 * (co - i);
			if (a <= 21)sum = max(a, sum);
		}
		if (sum > 21)cout << 0 << endl;
		else cout << sum << endl;
	}
}