

Input:
N = 4
Output:
1 2 Hello 4
Explanation: 1, 2, and 4 are not divisible by 3 and 5. 3 is divisible by 3, so we return ‘Hello’.
Hence, we return [‘1’, ‘2’, ‘Hello’, ‘4’].
The first line of the input will contain the number of test cases, 'T'.
The first line of each test case contains an integers ‘N’.
Output is printed on a separate line.
You don’t need to print anything. Just implement the given function.
1 <= T <= 10
1 <= N <= 10^5
The sum of N <= 10^6 over test cases
Time Limit: 1 sec
Algorithm:
Count Special Palindromic Substrings
Special Numbers
Minimum Operations To Make Array Equal
Ninja's Encryption
Minimum Window Subsequence
Minimum Window Subsequence
Minimum Window Subsequence
Minimum Window Subsequence
Minimum Window Subsequence
Minimum Window Subsequence