#include <bits/stdc++.h>
using namespace std;
deque<char>q[14];
int sum[14],lives=4;
int main()
{
	for(int x=1;x<=13;x++)
	{
		for(int y=0;y<4;y++)
		{
			char num;
			cin>>num;
			q[x].push_back(num);
		}
	}
	int p=13;
	while(!q[13].empty())
	{
		char Iget;
		if(p==13)
		{
			Iget=q[p].front();
			q[p].pop_front();
		}
		else
		{
			Iget=q[p].back();
			q[p].pop_back();
		}
		switch(Iget)
		{
			case '0':
				q[10].push_front(Iget),p=10;
				sum[p]++;
				break;
			case 'A':
				q[1].push_front(Iget),p=1;
				sum[p]++;
				break;
			case '2':
				q[2].push_front(Iget) ,p=2;
				sum[p]++;
				break;
			case '3':
				q[3].push_front(Iget),p=3;
				sum[p]++;
				break;
			case '4':
				q[4].push_front(Iget),p=4;
				sum[p]++;
				break;
			case '5':
				q[5].push_front(Iget),p=5;
				sum[p]++;
				break;
			case '6':
				q[6].push_front(Iget),p=6;
				sum[p]++;
				break;
			case '7':
				q[7].push_front(Iget),p=7;
				sum[p]++;
				break;
			case '8':
				q[8].push_front(Iget),p=8;
				sum[p]++;
				break;
			case '9':
				q[9].push_front(Iget),p=9;
				sum[p]++;
				break;
			case 'J':
				q[11].push_front(Iget),p=11;
				sum[p]++;
				break;
			case 'Q':
				q[12].push_front(Iget),p=12;
				sum[p]++;
				break;
			case 'K':	
				p=13;
				break;
		}
	}
	int add=0;
	for(int i=1;i<=12;i++)
	{
		if(sum[i]==4) add++;
	}
	cout<<add;
	return 0;
}