type sir=string[17];
var n,i,j,l,k:longint;
    v:array[1..36001] of sir;
    f,g:text;
    c:char;
    ok:boolean;

procedure QuickSort(var A: sir; Lo, Hi: Integer);

procedure Sort(l, r: Integer);
var
  i, j: integer;
  x,y:char;
begin
  i := l; j := r; x := a[(l+r) DIV 2];
  repeat
    while a[i] < x do i := i + 1;
    while x < a[j] do j := j - 1;
    if i <= j then
    begin
      y := a[i]; a[i] := a[j]; a[j] := y;
      i := i + 1; j := j - 1;
    end;
  until i > j;
  if l < j then Sort(l, j);
  if i < r then Sort(i, r);
end;

begin {QuickSort};
  Sort(Lo,Hi);
end;


begin
        assign(f,'restante.in');
        assign(g,'restante.out');
        reset(f);
        rewrite(g);
        readln(f,n);
        for i:=1 to n do begin
                          readln(f,v[i]);
                          quicksort(v[i],1,length(v[i]));
                          ok:=true;
                          if i>1 then begin
                          for j:=1 to i-1 do if v[i]=v[j] then begin
                                                                ok:=false;
                                                                break;
                                                               end;
                          if ok then inc(k);
                                end;
                         end;
        write(g,k);
        close(f);
        close(g);
end.