codeforce-------Aramic script

In Aramic language words can only represent objects.
Words in Aramic have special properties:

A word is a root if it does not contain the same letter more than once.
A root and all its permutations represent the same object.
The root xx of a word yy is the word that contains all letters that appear in yy in a way that each letter appears once. For example, the root of “aaaa”, “aa”, “aaa” is “a”, the root of “aabb”, “bab”, “baabb”, “ab” is “ab”.
Any word in Aramic represents the same object as its root.

You have an ancient script in Aramic. What is the number of different objects mentioned in the script?InputThe first line contains one integer nn (1≤n≤1031≤n≤103) — the number of words in the script.
The second line contains nn words s1,s2,…,sns1,s2,…,sn — the script itself. The length of each string does not exceed 103103.
It is guaranteed that all characters of the strings are small latin letters.OutputOutput one integer — the number of different objects mentioned in the given ancient Aramic script.
Examples
Input
5
a aa aaa ab abb
Output
2
Input
3
amer arem mrea
Output
1
NoteIn the first test, there are two objects mentioned. The roots that represent them are “a”,“ab”.
In the second test, there is only one object, its root is “amer”, the other strings are just permutations of “amer”.

Subject to the effect: give some tokens, consisting of letters is called a root which gives some words, seeking a total of how many roots

#include <iostream>
#include <cstdio>
#include <set>
using namespace std;
const int N = 1010;
set<char> s;
set<set<char>> q;
char str[N];
int main(){
 int n;
 cin >> n;
  for (int i = 1; i <= n; i ++){
  cin >> str;
  for (int i = 0; str[i];  i ++){
   s.insert(str[i]);
  }
   q.insert(s);
  s.clear();
 }
 cout << q.size() << endl;
  return 0;
}