DeveloperOC

        if(words[i + 1].length() >= len && words[i + 1].substr(0,len) == words[i])
            continue;

	if(words[i + 1].length() < len)
            continue;
	if(words[i + 1].substr(0,len) == words[i])
            continue;

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int N;
string words[51];
int main()
{
    int ans = 0;
    cin >> N;

    for(int i = 0; i < N; ++i)
    {
        cin >> words[i];
    }

    sort(words, words + N);

    for(int i = 0; i < N - 1; ++i)
    {
        int len = words[i].length();

        if(words[i + 1].length() >= len && words[i + 1].substr(0,len) == words[i])
            continue;

        ans++;
    }

    ans++;

    cout << ans;
    return 0;
}