Find number of quadruples `(x, y, z, w)` in an unsorted array such that `x + y + z = w` and `index(x) < index(y) < index(z) < index(w)`.\n\n**Example 1:**\n```\nInput: [3, 5, 4, 7, 12, 1]\nOutput: 1\nExplanation:\nBeacuse (3, 5, 4, 12) is one quadruple such that 3 + 5 + 4 = 12 and index(3) < index (5) < index(4) < index(12).\n```\n \n**Example 2:**\n```\nInput: [3, 5, 4, 7, 12, 1, 10]\nOutput: 2\nExlanation:\n(3, 5, 4, 12) is one quadruple such that 3 + 5 + 4 = 12 and index(3) < index (5) < index(4) < index(12).\n(5, 4, 1, 10) is second quadruple such that 3 + 5 + 4 = 12 and index(5) < index (4) < index(1) < index(10).\n```

Find number of quadruples (x, y, z, w) in an unsorted array such that x + y + z = w and index(x) < index(y) < index(z) < index(w).\n\nExample 1:\n\nInput: [3, 5