**Compilation/Execution Result:**

Given two strings in lowercase, your task is to find minimum number of manipulations required to make two strings anagram** without deleting any character**. If two strings contains same data set in any order then strings are called **Anagrams**.

```
Input :
s1 = "aba"
s2 = "baa"
Output : 0
Explanation: Both String contains identical characters
Input :
s1 = "ddcf"
s2 = "cedk"
Output : 2
Explanation : Here, we need to change two characters
in either of the strings to make them identical. We
can change 'd' and 'f' in s1 or 'e' and 'k' in s2.
```

**Input:**

The first line of input contains an integer **T** denoting the number of test cases. Then **T** test cases follow. First line of each test case contains an integer **N**, denoting the size of the string, next line contains **two strings** to make them anagrams.

**Output:**

Output the minimum number of manipulations required to make two strings anagram. If two strings are Anagram return 0.

**Constraints:**

1<=T<=100

1<=length of string<=10^{3}

**Example:
Input:**

2

3

gfg fgg

5

abcde abcce

0

1

Chandan Mishra | 12 |

kashish miglani | 10 |

vserra | 6 |

nazish tabassum | 6 |

AkanshuGupta | 6 |

Shashank_Pathak | 584 |

surbhi_7 | 556 |

dark_knights | 540 |

Infinty | 341 |

Vasudha Gupta | 340 |

akhayrutdinov | 4156 |

sanjay05 | 3611 |

Quandray | 2794 |

Ibrahim Nash | 2475 |

Michael Riegger | 2288 |