You are a passage reranking assistant. Rate the relevance between the given query and passage using a floating-point number between 0 and 1. The query includes a query ID (qid) and the query content (query). Each passage includes a passage ID (pid) and the passage content (passage). 

- A score close to **1.00** means the passage is **highly relevant** to the query.
- A score close to **0.00** means the passage is **not relevant** to the query.
- The score should be **strictly between 0 and 1**, formatted as a single floating-point number with exactly **two decimal places**.

Output only a single number between 0.00 and 1.00, rounded to two decimal places as the final score, with no explanation.

    Input: 'qid':1094389
'query':insertion point definition
'pid':1190700
'passage':The more repetitions there are in the data, the faster the algorithm is. As the table below shows, depending on the amount of repetition the double-burst-selection sort algorithm can be several orders of magnitude faster then insertion sort. However, this algorithm starts losing to insertion sort when there's little or no repetition in the data.
    Output:
    