Unique Encryptions in Nexus Prime | Problem Statement In the futuristic city of Nexus Prime, a tech organization stores large amounts of encrypted data files. Each file's content is scrambled using different arrangements of letters to create unique encryption patterns. Dr. Axiom, the lead engineer, needs to figure out how many different ways a file can be scrambled (encrypted). As the size of the files grows, Dr. Axiom must find a fast way to count all possible unique arrangements of characters in the file. Your task is to help Dr. Axiom by writing a program that, given a string s (representing the encrypted file), calculates how many unique ways the letters in the string can be rearranged. Return the answer modulo 10^9+7 to manage large numbers. For example, if the string is "hidden code", there are many possible ways to rearrange the letters, like "hidden code", "ihdden code", "diden hode", "denh codei", and more. Your goal is to find out how many such unique arrangements exist. Input Format The first and only line consists of a single string S which represents the contents of the encrypted file. The string consists of lowercase English letters and spaces "'. There is a single space between consecutive words.