#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
using namespace std;
#define int long long
#define P pair
#define pi P<int,int>
#define ff first
#define ss second
#define mp make_pair
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define V vector
#define vi V<int>
#define v2i V<vi>
#define v3i V<v2i>
#define vpi V<pi>
#define vb V<bool>
#define v2b V<vb>
#define pb push_back
#define S set
#define si S<int>
#define ins insert
#define era erase
#define M map
#define mii M<int,int>
#define Q queue
#define PQ priority_queue
const int MOD=1e9+7;
const int p1 = 31;
const int p2 = 37;
const int INF=1e18;
int smax(int& a, int b) {return a = max(a,b);}
int smin(int& a, int b) {return a = min(a,b);}

long long binpow(long long a, long long b, long long m = MOD) {
    a %= m;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}

int n;
const int L = 26;
int adj[L][L] = {0};
M<P<pi, int>,int> val;
V<string> word;

P<pi, int> h(int (&a)[L][L], int pos) {
	int h1 = 0;
	int h2 = 0;
	for (int i = 0; i < L; i++) {
		for (int j = 0; j < L; j++) {
			h1 += (binpow(p1,i*L+j) * (a[i][j]+1))%MOD;
			h1 %= MOD;
			h2 += (binpow(p2,i*L+j) * (a[i][j]+1))%MOD;
			h2 %= MOD;
		}
	}
	return mp(mp(h1, h2), pos);
}

int dfs(int (&a)[L][L], int pos) {
	P<pi, int> av = h(a, pos);
	if (val.count(av)) {return val[av];}
	for (int nxt = 0; nxt < L; nxt++) {
		if (a[pos][nxt]) {
			a[pos][nxt]--;
			int v1 = dfs(a, nxt);
			a[pos][nxt]++;
			if (v1 == 0) {
				val[av] = 1;
				return 1;
			}
		}
	}
	return 0;
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	cin >> n;
	for (int i = 0; i < n; i++) {
		string s; cin >> s;
		word.pb(s);
		adj[s[0]-'a'][s[sz(s)-1]-'a']++;
	}
	for (int i = 0; i < L; i++) {
		adj[i][i] %= 2;
		for (int j = i+1; j < L; j++) {
			if (adj[i][j] && adj[j][i]) {
				int sub = min(adj[i][j], adj[j][i]);
				adj[i][j] -= sub;
				adj[j][i] -= sub;
			}
		}
	}
	int ans = 0;
	for (string s : word) {
		int s1 = s[0] - 'a';
		int s2 = s[sz(s)-1] - 'a';
		if (adj[s1][s2]) {
			adj[s1][s2]--;
			ans += dfs(adj, s2);
			adj[s1][s2]++;
		} else {
			adj[s2][s1]++;
			ans += dfs(adj, s2);
			adj[s2][s1]--;
		}
	}
	cout << n - ans;
	return 0;
}