#include<iostream>
#include<cstring>

int field[14][14];

void dfs(int r,int c);

int main()
{
	int num;
	char buf[14];
	while(1)
	{
		num=0;
		memset(field,0,sizeof(field));
		for(int i=1;i<=12;i++)
		{
			if(std::cin.eof())break;
			std::cin.getline(buf,14);
			if(buf[0]=='\0')
			{
				i--;
				continue;
			}
			for(int j=1;j<=12;j++)
			{
				field[i][j]=buf[j-1]-'0';
			}
		}
		if(std::cin.eof())break;
		
		for(int i=1;i<=12;i++)
		{
			for(int j=1;j<=12;j++)
			{
				if(field[i][j]==1)
				{
					dfs(i,j);
					num++;
				}
			}
		}
		std::cout<<num<<std::endl;
	}
	return 0;
}

void dfs(int r,int c)
{
	field[r][c]=0;
	if(field[r-1][c]==1){dfs(r-1,c);}
	if(field[r+1][c]==1){dfs(r+1,c);}
	if(field[r][c-1]==1){dfs(r,c-1);}
	if(field[r][c+1]==1){dfs(r,c+1);}
}
#include<bits/stdc++.h>
using namespace std;

typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int,int> pii;
typedef priority_queue< int, vector< int >, greater< int > >  minHeap;

#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define scn(n) scanf("%d",&n)
#define scnll(n) scanf("%lld",&n)
#define scn2(n,m) scanf("%d%d",&n,&m)
#define scn3(n,m,w) scanf("%d%d%d",&n,&m,&w)
#define scn2ll(n,m) scanf("%lld%lld",&n,&m)
#define atoz(v) v.begin(),v.end()
#define ratoz(v) v.rbegin(),v.rend()
#define Fill(a,v) memset(a,v,sizeof(a))
#define fi first
#define se second
#define inf 1e9
#define pi acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define mod 1000000007
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define bug(x) cerr << __LINE__ << " says: " << #x << " = " << (x) << "\n"

int Set(int N,int pos)
{
    return N=N | (1<<pos);
}
int reset(int N,int pos)
{
    return N = N & ~(1<<pos);
}
bool check(int N,int pos)
{
    return (bool)(N & (1<<pos));
}

inline int addmod(lli x,lli y)
{
    return (x%mod + y%mod)%mod;
}
inline int submod(lli x,lli y)
{
    return (x%mod - y%mod + mod)%mod;
}
inline int mulmod(lli x,lli y)
{
    return (x%mod * y%mod)%mod;
}


inline int nextSubMask(int i, int mask)
{
    return (i-1)&mask;   /// returns next  submask
}

template<typename T>
void we_r_done(T mssg)
{
    cout<<mssg;
    exit(0);
}


int main()
{
    ///freopen("output.txt","w",stdout);
  // freopen("input.txt","r",stdin);
    FastIO;

    string s;
    while(cin>>s){
        int n = s.size();
        lli ans = 1 + n*1LL*(n-1)/2;
        vector<int>cnt(30,0);
        for(int i=0; i<n; i++){
            cnt[s[i]-'a']++;
        }
        for(int i=0; i<26; i++) ans -= cnt[i]*1LL*(cnt[i]-1)/2;

        cout<<ans<<endl;
    }

    return 0;
}

///sin and cos expect input in radians not degrees. so use , sin(degrees * pi / 180)
///using bs = bitset<MX>; // how many distinct number can be form?
///sort(atoz(v), [](const data x, const data y){return (x.a==y.a?x.b>y.b : x.a<y.a);});
