Go: package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)

func Sliceconvtoi() []int {
	strs := strings.Split(sc.Text(), " ")

	var ints []int
	var x int

	for _, s := range strs {
		x, _ = strconv.Atoi(s)
		ints = append(ints, x)
	}

	return ints
}

func main() {
	for sc.Scan() {
		i := Sliceconvtoi()
		fmt.Println(int(math.Log10(float64(i[0]+i[1]))) + 1)
	}

}

C++: #include<iostream>
using namespace std;
int main(){
	int a,b,c,i;
	int n=0;
	int s[300];
	while(cin>>a>>b){
		a+=b;
		c=10;
		for(i=1;i<10;i++){
			if(a<c){
				break;
			}
			c*=10;
		}
		s[n]=i;
		n++;
	}
	for(i=0;i<n;i++){
		cout<<s[i]<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<cmath>
int main() {
	int a, b;
	for (int i = 0;i < 200;++i) {
		std::cin >> a >> b;
	}
	int d = 0;
	for (int i = 0;i < 7;++i) {
		if (pow(10, i)) {
			++b;
		}
	}
	std::cout << d << std::endl;
	return 0;
}

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

int Number_of_digits(int n)
{
	int digits = 1;

	while (1) {
		n /= 10;
		if(n)
			++digits;
		else break;
	}

	return digits;
}

int main(int argc, char **argv)
{
	int a, b;
	while (cin >> a >> b) {

		cout << Number_of_digits(a + b) << endl;

	}

	return 0;
}

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

int a;
int b;

int main(){
	for (int i = 0; i < 200; i++){
		cin >> a >> b;
		if (a + b >= 1000000){
			cout << "7" << endl;
		}
		if (a + b >= 100000&&a+b<1000000){
			cout << "6" << endl;
		}
		if (a + b >= 10000&&a+b<100000){
			cout << "5" << endl;
		}
		if (a + b >= 1000&&a+b<10000){
			cout << "4" << endl;
		}
		if (a + b >= 100&&a+b<1000){
			cout << "3" << endl;
		}
		if (a + b >= 10&&a+b<100){
			cout << "2" << endl;
		}
		if (a + b >= 0 && a + b<10){
			cout << "1" << endl;
		}


}
	return 0;
}

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

int main(){
	int a, b, c;
	while ( cin >> a >> b ) {
		a += b;
		ans = 0;
		while( a > 0 , c++ , a /= 10 );
		cout << c << endl;
	}
}

C++: #include <iostream>
using namespace std;
int main(){
	int a,b;
	while(cin >> a >> b){
	int c = a + b;
	int k = 1;
	while(c>=10){
		c /= 10;
		k++;
	}
	}
}

C++: #include <stdio.h>

int main(){

	int a=0,b=0,i=0;

	while (scanf("%d%d", &a, &b) != EOF){
		
		if (a + b < 10){
			printf("1\n");
		}else if(a + b < 100){
			printf("2\n");
		}else if (a + b < 1000){
			printf("3\n");
		}else if (a + b < 10000){
			printf("4\n");
		}else if (a + b < 100000){
			printf("5\n"); 
		}else{
			printf("6\n");
		}i++;
	}
	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
 int a, b, c, count = 0;
 cin >> a >> b;
 c = a + b;
 while(c != 0){
  c = c / 10;
  count++;
 }
 cout << count << endl;

 return 0; 
}

C++: #include <cstdio>
#include <cstring>

int main()
{
	int a, b;
	while (scanf("%d %d", &a, &b) != EOF)
	{
		int s = a+b;
		int ans = 1;
		while (s > 9)
		{
			s /= 10;
			++ans;
		}
		printf("%d\n", ans);
	}

	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,x); REP(i,sizeof(a)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define FILL2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"

#define umap unordered_map
//cout << setfill('0') << right << setw(4) << 12; // "0012"
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
ll sum(ll a[],ll N){ return accumulate(a,a+N,0LL);}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a/gcd(a,b)*b;}

int main(){
  int a,b;
  while(cin>>a>>b){
    cout << keta(a+b) <<"\n";
  }
}

C++: #include<iostream>
#include<cmath>

using namespace std;

int main(void){

 int a,b;
 int sum;
 int ans;

 while(1){
  cin >> a >> b;
  sum=a+b;
  ans=log10(sum)+1;

  cout << ans << endl;
 }
}

C++: #include<stdio.h>
int main()
{
    long int a,b,sum,temp,i=0,j=0;
    while (scanf("%ld%ld",&a,&b)==2)
    {
        while(a!=0)
        {
            temp=a%10;
            a=a/10;
            if(temp!=0)
            {
                i++;
            }
        }
        while(b!=0)
        {
            temp=b%10;
            b=b/10;
            if(temp!=0)
            {
                j++;
            }
        }
        sum=i+j;
        printf("%ld\n",sum);
    }
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
    int a,b;
    while(scanf("%d %d",&a,&b) != EOF){
        int sum = a + b, cnt = (sum == 0 ? 1 : 0);
        while(sum > 0){
            sum /= 10;
            cnt++;
        }
        cout << cnt << endl;
    }

    return 0;
}

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

int main() {
	int a,b;
	while(true){
	cin >> a;
	if(cin.eof())
		break;
	cin >> b;
	a = a+b;
	int digit=1;
	while(true){
		if(a < 10^digit )
			break;
		else
			digit++;	
	}
	cout << digit << endl;
	
	}
	return 0;

}

C++: #include<iostream>

using namespace std;

int main(){
	int a,b,c,i;
	i=0;
	while(cin>>a>>b){
	c=a+b;
	while(c>0){
	c /= 10;
	i += 1;
	}
	cout<<i<<endl;
	i=0;
	}
}

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

int main()
{
  int a, b;
  int cou;
  int i, j;
  int ten;

  for (i = 0; i < 200; i++){
    cou = 0;
    ten = 1;
    cin >> a >> b;
    a += b;
    for (j = 1; j <= 7; j++){
      if (a / ten > 0){
        cou++;
        ten  *= 10;
      }
    }
    cout << cou << "\n";
  }

  return (0);
}

C++: #include <iostream>
#include <string>

using namespace std;

int main()
{
    string ans;
    int a, b;

    while (cin >> a >> b)
    {
        cout << to_string(a + b).length() << endl;
    }
}

C++: #include <iostream>

using namespace std;

int main ( void )
{
  int a, b;
  while (cin >> a >> b)
  {
    int c = a + b, digit = 0;

    do
    {
      c /= 10;
      ++digit;
    } while (c);

    cout << digit << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
 
int main() {
  int n1,n2,total;
  while ( cin >> n1 >> n2 ) {
    total = n1 + n2;
    int n = 0;
    while (1) {
      if ( total < 1 ) break;
      total /= 10;
      n++;
    }
    cout << n << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>

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 <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <cstdio>

using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;(i)>=0;(i)--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())

typedef long long ll;

int main(){
    
    int a,b;
    while(cin>>a){
        cin>>b;
        a=a+b;
        if(a==0)cout<<1<<endl;
        else{
            int ans=0;
            while(a!=0){
                ans++;
                a/=10;
            }
            cout<<ans<<endl;
        }
    }
    
    return 0;
}