You are working in a chemical factory. Each chemical in the factory is represented by a string. You have to group the chemicals in such a way that no two explosive chemicals are together. You are given an array of size N$,$ denoting the names of N chemicals. Let x and y be two strings representing two chemicals. Let z$=$x$+$x$($ For example, if x$=$"abc"

then z$=$"abcabc $"$

$).$ The chemicals x and y are said to be explosive if we can jumble the characters of string z to get chemical y$.$ Your task is to return the number of pairs of chemicals that are explosive. Input Specification: input$1$: An integer N denoting the size of the array. input$2$: An array of strings denoting the names of N chemicals.

Output Specification:

An integer denoting the number of pairs of chemicals that are explosive.

Example $1$:

input$1$: $5$

input$2$: $("$hacker$",$ "int", "niitnt", "hackhackerer", "long"$)$

Output: $2$

Example $2$:input$1$:$3$input$2$: $(\text{'}$medium$",$ "easy", "yeasseya"$)$Output: $1$

write a c$++$ code