Given two strings "s" and "t", Write a program to check whether the two strings are an anagram of each other or not.

Problem Note

• "s" is an anagram of "t" if the characters of "s" can be rearranged to form "t".
• You may assume the string contains only lowercase alphabets.

Example 1

Input: s = “admirer” , t = “married”
Output: 1

Example 2

Input: s = “mindorks”, t = “mindrocks”
Output: 0