program Restante;
const
   abc : string = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz';
var
   Fl : text;
   a : array[0..36000] of string[16];
   k : array[0..36000] of byte;
   n, i, j, l : longint;
   s1 : char;
   s : longint;

procedure Quick_Sort(inc, sfr : integer);
var
   i, j, x : integer;
   y : char;
begin
   i := inc;
   j := sfr;
   x := pos(a[l][(inc+sfr) div 2],abc);

   repeat
     while pos(a[l][i],abc) < x do
        i := i+1;
     while pos(a[l][j],abc) > x do
        j := j-1;
     if i <= j then
        begin
           y := a[l][i];
           a[l][i] := a[l][j];
           a[l][j] := y;
           i := i + 1;
           j := j - 1;
        end;
   until i>j;

   if inc < j then
      Quick_Sort(inc,j);
   if sfr > i then
      Quick_Sort(i,sfr);

end;
begin
   assign(fl,'restante.in');
   reset(fl);
   readln(fl,n);
   for l := 1 to n do
      begin
         readln(fl,a[l]);
         quick_sort(1,length(a[l]));
        k[i] := 0;
      end;
   close(fl);

   for i := 1 to n do
      if k[i] = 0 then
         for j := i+1 to n do
            if a[i] = a[j] then
                begin
                   k[i] := 1;
                   k[j] := 1;
                end;

   s := 0;
   for i := 1 to n do
      if k[i] = 0 then
         s := s + 1;

   assign(fl,'restante.out');
   rewrite(fl);
   writeln(fl,s);
   close(fl);
end.