Problem : You are given an array of N integers. You have to print the total number of strictly decreasing subsequences of the array ?
Note : You cannot consider a single element to be in any strictly decreasing subsequence.(At least two elements are needed to form a strictly decreasing subsequence)

Example : Array = {15,10,20,5}
Output : 5
Explanation : The 5 strictly decreasing subsequences are {15,10}, {15,5}, {15,10,5}, {10,5}, {20,5}.

Constraints:
1≤N≤10^5
1≤Ai≤10^9 for each valid i

Motivation of the problem : I think the Subtask #1 (20 Points) of this Problem(Bunny Hops) wants us to print this only.

Awaiting for your help. Thank You !