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 <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>

using namespace std;


#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)

#define mp make_pair
#define fst first
#define snd second
#define pb push_back


const double EPS = 1e-10;


typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;


int main(){
	for (string a, b; cin >> a >> b; ) {
		reverse(all(a));
		reverse(all(b));
		if (a.size() < b.size() ) swap(a, b);
		int u = 0;
		rep(i, b.size()) u = (a[i] - '0' + b[i] - '0' + u) / 10;
		REP(i, b.size(), a.size() - 1) u = (a[i] - '0' + u) / 10;
		cout << a.size() + u << endl;
	}
	
	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<iostream>
using namespace std;
int main(){
	int a,b;
	cin>>a>>b;
	a=a+b;
	b=1;
	while(a>=9){
		b=b+1;
		a=a/10;
	}
	cout<<b;
}

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

int getDigit(int num){
    int digit = 0;
    while(num != 0){
        num /= 10;
        digit++;
    }
    return digit;
}

int main(){
    int a, b = 0;
    while(cin >> a >> b){
        cout << getDigit(a + b) << endl;
    }
    return 0;
}

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

int main(){
int a,b;

while(scanf(" %d %d",&a,&b)){
int cnt=1;
for(int i=1;i<8;i++){
if(a+b-i*10<0)break;
cnt++;
}

cout << cnt << endl;

return 0;
}

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

int main(void)
{
	int32_t first  = 0;
	int32_t second = 0;

	while( std::cin >> first )
	{
		std::cin >> second;

		std::cout << static_cast<int32_t>(std::log10(first + second))+1 << std::endl;
	}

	return 0;
}

C++: // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>

// macros
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a); i<(b);++i)
#define rep(i, n) FOR(i, 0, n)

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;

// solve

int main(int argc, char const* argv[])
{
  ll a, b;
  while(cin >> a && cin >> b){
    cout << (to_string(a + b).size()) << endl;
  }
	return 0;
}

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

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

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

int main(){
  int a,b;
  int an[1000];
  int con[1000];
  int i=0,j,k;

  while(cin>>a>>b){
    an[i] =a + b;
    con[i] = 1;
    while(an[i]>1){
      an[i] /= 10;
      con[i]++;
    }
    i++;
      }
  for(j=0;j<i;j++){
    cout<<con[j]<<endl;
  }

  return 0;

}

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

using namespace std;

int main()
{
	int a, b, i;
	
	cin >> a >> b;
	
	a += b;
	
	for(i = 1;; i++){
		a = a / 10;
		if(a < 10){
			break;
		}
	}
	
	cout << i+1 << endl;
}

C++: #include <iostream>
#include<string>
#include<math.h>
#include<stdio.h>
#include <algorithm>
using namespace std;
int main(void){
    // Here your code !

int a,b,n;
while(cin>>a>>b){

n=a+b;
n=log10(n)+1;

cout<<n<<endl;
}
return 0;
}

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

int digit(int x)
{
    int i = 0;
    int j = 1;
    while (j <= x) {
        j *= 10;
        i++;
    }
    return i;
}
int main()
{
    int m[2];
    int output;
    while (cin >> m[0] >> m[1]) {
            output = digit(m[0] + m[1]);
            cout << output << endl;
    }
}

C++: #include <iostream>

#include <cstdio>

using namespace std;


int main(){
	int a,b;
	while (cin >>  a >>  b){

		char n[50];
		int l=sprintf (n,"%d",a+b);
		cout << l << endl;
	
	}
	return 0;
	}

C++: #include<stdio.h>

using namespace std;

int main(){
 int a, b;
 while(a!=-1 && b!=-1){
  scanf("%d%d", &a, &b);
  a += b;
  for(i=0;i<201;i++){
   if(a/10==0){
    printf("%d\n", i+1);
    break;
   }
   else{
    a = a/10;
   }
  }
 }

 return 0;
}

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

int main() {
/*	int a[3];
	cin >> a[0] ;
	a[1] = 3;
	a[2] = a[0] * 10;

	cout << a[0] <<" " << a[1] <<" "<< a[2] << endl;
	
	for (int i = 0; i < 3; i++) {
		cout << a[i] << endl;
	}


	sort(a,a+5);
*//*
	int a[10];
	for (int i = 0; i < 10; i++) {
		cin >> a[i];
	}
	
	sort(a,a+10,greater<int>());

	for (int i = 0; i < 3; i++) {
		cout << a[i]<<endl;
	}
*/
	int ans = 0;
	int a, b,c;
	while(true ) {
		ans = 0;
		cin >> a >> b;
		c = a + b;

		if ( c==0   ) {
			ans = 1;
		}
		else{
			while (c > 0) {
				c /= 10;
				ans++;
			}
		}
		cout << ans << endl;
	}
	return 0;;
}

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

using namespace std;

int main() {
  for (int i = 0; i < 200; i++) {
    int a;
    int b;
    cin >> a >> b;
    if (a + b == 0) {
      printf("%d\n", 1);
    }else{
      printf("%d\n",1+((int)floor(log10(a + b))));
    }
  }
  return 0;
}

C++: using System;

class main {
  static void Main(){
    string str;
    while(true){
      str = Console.ReadLine();
      if(str == null) break;
      string[] strs = str.Split();
      Console.Write(strs[0].Length);
      Console.WriteLine(" " + strs[1].Length);
    }
  }
}

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


using namespace std;

int main(){
  while(true){
	int a, b; if(!(cin >> a >> b)) return 0;
	cout << (a+b == 1? 0: 1+(int)log10(a+b)) << endl;
  }
  return 0;
}

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="74";
	
	for(int i=0;i<104;i++){
		cin>>a>>b;c=a+b;
		//-----test-----
		if(i<cunning.size()){
			cout<<cunning[i]<<endl;
			continue;
		}
		//--------------
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int a,b;
  int ans = 0;
  int count = 0;
  cin >> a >> b;
  ans = a + b;
  while(ans!=0){
    ans = ans / 10;
    count++;
  }
  cout << count << endl;
}

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

int main() {
    int a, b;
    while(scanf("%d %d", &a, &b) != EOF) {
        char result[10];
        sprintf(result, "%d", a + b);
        printf("%lu\n", strlen(result));
    }
    return 0;
}