//ALICE AND BOB ARE PLAYING A GAME USING AN INTEGER ARRAY 𝑎 OF SIZE 𝑛.
 
// INITIALLY, ALL ELEMENTS OF THE ARRAY ARE COLORLESS. FIRST, ALICE CHOOSES 3 ELEMENTS AND COLORS THEM RED. THEN BOB CHOOSES ANY ELEMENT AND COLORS IT BLUE (IF IT WAS RED — RECOLOR IT). ALICE WINS IF THE SUM OF THE RED ELEMENTS IS STRICTLY GREATER THAN THE VALUE OF THE BLUE ELEMENT.
 
// YOUR TASK IS TO CALCULATE THE NUMBER OF WAYS THAT ALICE CAN CHOOSE 3 ELEMENTS IN ORDER TO WIN REGARDLESS OF BOB'S ACTIONS.
 
// SAMPLE INPUT:
 
// 3
// 1 2 3 
 
// 4
// 1 1 2 4
 
// 5
// 7 7 7 7 7
 
// 5
// 1 1 2 2 4
// 1 2 2 
// 1 2 2
 
// SAMPLE OUTPUT:
// 0
// 0
// 10
// 2
 
 
#include <iostream>
using namespace std;
 
int main() {
	// your code goes here
	return 0;
}

Ly9BTElDRSBBTkQgQk9CIEFSRSBQTEFZSU5HIEEgR0FNRSBVU0lORyBBTiBJTlRFR0VSIEFSUkFZIPCdkY4gT0YgU0laRSDwnZGbLgoKLy8gSU5JVElBTExZLCBBTEwgRUxFTUVOVFMgT0YgVEhFIEFSUkFZIEFSRSBDT0xPUkxFU1MuIEZJUlNULCBBTElDRSBDSE9PU0VTIDMgRUxFTUVOVFMgQU5EIENPTE9SUyBUSEVNIFJFRC4gVEhFTiBCT0IgQ0hPT1NFUyBBTlkgRUxFTUVOVCBBTkQgQ09MT1JTIElUIEJMVUUgKElGIElUIFdBUyBSRUQg4oCUIFJFQ09MT1IgSVQpLiBBTElDRSBXSU5TIElGIFRIRSBTVU0gT0YgVEhFIFJFRCBFTEVNRU5UUyBJUyBTVFJJQ1RMWSBHUkVBVEVSIFRIQU4gVEhFIFZBTFVFIE9GIFRIRSBCTFVFIEVMRU1FTlQuCgovLyBZT1VSIFRBU0sgSVMgVE8gQ0FMQ1VMQVRFIFRIRSBOVU1CRVIgT0YgV0FZUyBUSEFUIEFMSUNFIENBTiBDSE9PU0UgMyBFTEVNRU5UUyBJTiBPUkRFUiBUTyBXSU4gUkVHQVJETEVTUyBPRiBCT0InUyBBQ1RJT05TLgoKLy8gU0FNUExFIElOUFVUOgoKLy8gMwovLyAxIDIgMyAKCi8vIDQKLy8gMSAxIDIgNAoKLy8gNQovLyA3IDcgNyA3IDcKCi8vIDUKLy8gMSAxIDIgMiA0Ci8vIDEgMiAyIAovLyAxIDIgMgoKLy8gU0FNUExFIE9VVFBVVDoKLy8gMAovLyAwCi8vIDEwCi8vIDIKCgojaW5jbHVkZSA8aW9zdHJlYW0+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCXJldHVybiAwOwp9