How to find a suitable index for a value in an array min binary heap?

1

How do I find a suitable index for a value X in an array implemented min binary heap in o(log log n) time? (no actual insertion is required)