Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)

func main(){
	sc.Split(bufio.ScanWords)
	defer out.Flush()
	for sc.Scan(){
	    s := nextIntIs()
	    sc.Scan()
	    t := nextIntIs()
        a := len(strconv.Itoa(s+t))
	    fmt.Fprintln(out, a)
	}
}

func next() string{
	sc.Scan()
	return sc.Text()
}

func nextInt() int{
	a, _ := strconv.Atoi(next())
	return a
}

func nextIntIs() int{
	a, _ := strconv.Atoi(sc.Text())
	return a
}

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>
using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const long double EPS = 1e-30;
const double INF = 1e12;

long double to_deg(long double r) {
    return r * 180.0 / (atan(1.0) * 4.0);
}
int main(){
	int a,b;
	while(cin>>a>>b){
		cout<<SZ(toString(a+b))<<endl;
	}
	return 0;
}

C++: k

C++: #include <bits/stdc++.h>
 
using namespace std;
 
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define INF 1 << 25
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << "\n";
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
 
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned int uint;
typedef unsigned long long ull;
 
const double EPS = 1e-10;
const double PI = acos( -1.0 );
 
int a, b;

int main() {
    while ( scanf( "%d %d", &a, &b ) != EOF ) {
        a += b;
        int ans = 0;
        while ( true ) {
            if ( a / 10 == 0 && a % 10 == 0 ) {
                break;
            }
            ans++;
            a /= 10;
        }
        printf( "%d\n", ans );
    }
    return 0;
}

C++: #include <algorithm>
#include <iostream>
#include <list>
using namespace std;

int check_digit(int num) {
  int digit = 0;
  while (true) {
    num /= 10;
    digit++;
    if (num <= 0) {
      break;
    }
  }
  return digit;
}

int digit_count(int a, int b) {
  int digit_a, digit_b;
  digit_a = check_digit(a);
  digit_b = check_digit(b);
  std::cout << digit_a + digit_b << '\n';
}

int main(int argc, char const *argv[]) {
  int a, b;
  while (!std::cin.eof()) {
    std::cin >> a;
    std::cin >> b;
    digit_count(a, b);
  }
}

C++: #include <iostream>
#include <cmath>
using namespace std;

int main()
{
    int a, b;
    while(cin >> a >> b)
    {
        cout << (int)log10(a + b) + 1 << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;
int main(){
	int a,b;
	while (1) {
		cin>>a;
		if(a == EOF)break;
		cin>>b;
		if(b == EOF)break;
		int ans = log10(a+b)+1;
		cout<<ans<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<sstream>
using namespace std;

int main(){
	int a,b,c;
	string str;
	stringstream ss;
	while(cin>>a>>b){
		c=a+b;
		ss<<c;
		str=ss.str();
		ss.str("");
		c=str.length();
		cout<<c<<endl;
	}
	return 0;
}

C++: #include <iostream>

int main(){
  while(true){
    int a, b;
    std::cin >> a >> b;
    if(std::cin.eof()) return 0;
    int c=0, s=a+b;
    while(s!=0){
      s/=10;
      c++;
    }
    std::cout << c << std::endl;
  }
}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <cassert>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define EACH(t,i,c) for(t::iterator i=(c).begin(); i!=(c).end(); ++i)
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int main(){
	int a,b;
	while(!cin.eof()){
		cin>>a>>b;
		cout<<toString(a+b).size()<<endl;
		
	}
}

C++: #include <iostream>
#include <stdio.h>
using namespace std;
 
int main(){
int a,b;
	cin>> a>> b;
	if(a+b<10){
		cout<< "1"<<endl;
	}
	if(10<=a+b && a+b<100){
		cout<< "2"<<endl;
	}
	if(100<=a+b && a+b<1000){
		cout<< "3"<<endl;
	}
	if(1000<=a+b && a+b<10000){
		cout<< "4"<<endl;
	}
	if(10000<=a+b && a+b<100000){
		cout<< "5"<<endl;
	}
	if(100000<=a+b && a+b<1000000){
		cout<< "6"<<endl;
	}
	if(1000000<=a+b){
		cout<< "7"<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
  long long a,b,ans;
  string s;
  for(int i=0;i<200;i++){
	cin >> a >> b;
	ans=a+b;
	s=to_string(ans);
	cout << s.size() << endl;
  }
  return 0;
}

C++: // aoj-1002.c

#include <stdio.h>

int main() {
	int a, b, temp;
	
	while(scanf("%d %d", &a, &b) != EOF) {
		printf("%d\n", sprintf(temp, "%d", a+b));
	}
	
	return 0;
}

C++: #include<iostream>
using namespace std;

int main(){

	int a[2];
	cin >> a[0] >> a[1];
	int check=a[0]+a[1],retval=1;
	while(check>=10){
		check/=10;
		retval++;
	}
	cout << retval << endl;

    return 0;
}

C++: #include <cstdio>
using namespace std;

int main() {
  int a, b;
  while (~scanf("%d %d", &a, &b)) {
    int sum, ans = 0;
    sum = a + b;
    while (sum) {
      sum /= 10;
      ++ans;
    }
    printf("%d\n", ans);
  }
}