#include<stdio.h>
int h[750005], l;
long long int s[750005][16];
int n;
int scmp(int a, int b)
{
	int i;
	for (i = 0;; i++)
	{
		if (s[a][i] == 0 && s[b][i] == 0)
			return 0;
		if (s[a][i] > s[b][i])
			return 1;
		if (s[a][i] < s[b][i])
			return -1;
	}
}
int comp_h(int a, int b)
{
	return scmp(h[a], h[b]);
}
void swap_h(int a, int b)
{
	int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(int ne)
{
	h[l] = ne;
	int p = l++;
	for (; p > 0; p = (p - 1) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
int pop()
{
	swap_h(0, --l);
	int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
void push_s(char x[], int xx, char y[], int yy, char z[], int zz)
{
	int i, j, k;
	k = j = 0;
	s[n][0] = 0;
	for (i = 0; i <= xx; i++)
	{
		s[n][k] = 27 * s[n][k] + x[i] - 'a' + 1;
		j++;
		if (j % 10 == 0)
		{
			k++;
			s[n][k] = 0;
		}
	}
	for (i = 0; i <= yy; i++)
	{
		s[n][k] = 27 * s[n][k] + y[i] - 'a' + 1;
		j++;
		if (j % 10 == 0)
		{
			k++;
			s[n][k] = 0;
		}
	}
	for (i = 0; i <= zz; i++)
	{
		s[n][k] = 27 * s[n][k] + z[i] - 'a' + 1;
		j++;
		if (j % 10 == 0)
		{
			k++;
			s[n][k] = 0;
		}
	}
	while (j % 10 > 0)
	{
		j++;
		s[n][k] *= 27;
	}
	s[n++][++k] = 0;
	return;
}
char x[64], y[64], z[64];
int main()
{
	scanf("%s%s%s", x, y, z);
	int i, j, k;
	n = 0;
	for (i = 0; x[i] != '\0'; i++)
	{
		for (j = 0; y[j] != '\0'; j++)
		{
			for (k = 0; z[k] != '\0'; k++)
			{
				push_s(x, i, y, j, z, k);
				push_s(x, i, z, k, y, j);
				push_s(y, j, x, i, z, k);
				push_s(y, j, z, k, x, i);
				push_s(z, k, x, i, y, j);
				push_s(z, k, y, j, x, i);
			}
		}
	}
	l = 0;
	for (i = 0; i < n; i++)
		push(i);
	int ans = 1;
	k = pop();
	while (l > 0)
	{
		i = pop();
		if (scmp(i, k) > 0)
			ans++;
		k = i;
	}
	printf("%d\n", ans);
	return 0;
}