#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>
#include <fstream>

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 MOD 1000000007
#define EPS 1e-10
#define MAX_N 100100
#define MAX_M 100100

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;
typedef pair<int, string> PSI;

string s;

int stringtoi(string s){
	int res;
	stringstream ss;
	ss << s;
	ss >> res;
	return res;
}

template <typename List> 
void split(const string s, const string delim, List& result){
	result.clear();

	string::size_type pos = 0;
	while (pos != string::npos){
		string::size_type p = s.find(delim, pos);

		if (p == -1){
			result.push_back(stringtoi(s.substr(pos)));
			break;
		}
		else{
			result.push_back(stringtoi(s.substr(pos, p - pos)));
		}

		pos = p + delim.size();
	}
}

int main(){
	while (getline(cin, s) && s != "0"){
		vector<int> vi;
		int cnt = 0, sum = 0;
		split(s, " ", vi);
		REP(i, vi.size()){
			if (vi[i] == 1)cnt++;
			if (vi[i] >= 10)sum += 10;
			else sum += vi[i];
		}
		while (sum <= 11 && cnt > 0){
			cnt--;
			sum += 10;
		}
		if (sum <= 21)cout << sum << endl;
		else cout << 0 << endl;
	}
}
### Prompt

In Cpp, your task is to solve the following problem:

Blackjack is a type of card game played in casinos, where the game is played using cards with numbers from 1 to 13. The score of each card is decided as follows.

* 1 is 1 point or 11 points
* From 2 to 9, the score is as written.
* 10 points from 10 to 13



There are several participants in this game, including parents, each with several sets of cards. This set of cards is called a hand. The hand score is the total of the card scores. The calculation shall be performed as follows.

* If the total score of the cards is greater than 21, the score of the hand is set to 0.
* As the score of the card, 1 may be calculated as 1 point or 11 points, but the one with the maximum hand score shall be selected.



Create a program that uses the information of the cards dealt as input and outputs the score of the hand.



Input

A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:


c1 c2 ... cn


The integer ci (1 ≤ ci ≤ 13) written on the i-th card is given to each line, separated by blanks. The number of cards n does not exceed 100.

The number of datasets does not exceed 200.

Output

The score of the hand is output to one line for each data set.

Example

Input

1
7 7 7
7 7 8
12 1
10 1 1
0


Output

11
21
0
21
12

### Response

```cpp
#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>
#include <fstream>

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 MOD 1000000007
#define EPS 1e-10
#define MAX_N 100100
#define MAX_M 100100

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;
typedef pair<int, string> PSI;

string s;

int stringtoi(string s){
	int res;
	stringstream ss;
	ss << s;
	ss >> res;
	return res;
}

template <typename List> 
void split(const string s, const string delim, List& result){
	result.clear();

	string::size_type pos = 0;
	while (pos != string::npos){
		string::size_type p = s.find(delim, pos);

		if (p == -1){
			result.push_back(stringtoi(s.substr(pos)));
			break;
		}
		else{
			result.push_back(stringtoi(s.substr(pos, p - pos)));
		}

		pos = p + delim.size();
	}
}

int main(){
	while (getline(cin, s) && s != "0"){
		vector<int> vi;
		int cnt = 0, sum = 0;
		split(s, " ", vi);
		REP(i, vi.size()){
			if (vi[i] == 1)cnt++;
			if (vi[i] >= 10)sum += 10;
			else sum += vi[i];
		}
		while (sum <= 11 && cnt > 0){
			cnt--;
			sum += 10;
		}
		if (sum <= 21)cout << sum << endl;
		else cout << 0 << endl;
	}
}
```