An isogram is a word in which the letters occur an equal number of times. The following are examples:

- First-order isogram (each letter appears once): byzantine
- Second-order isogram (each letter appears twice): reappear
- Third-order isogram (each letter appears three times): deeded

A phrase's isogram score is calculated as the sum of each word's score divided by the total length of the words in the phrase, rounded to the nearest hundredth. A word's score is 0 if the word is not an isogram; otherwise, it is computed by multiplying the isogram order level by the length of the word. Isogram scoring should treat words case-insensitively.

**Task:** Calculate the isogram score for the given input phrase.

**Input Format:**
- Input phrase is a string that will only be comprised of letters and spaces.
- Words will be separated by a single space. (Read from STDIN)

**Constraints:**
- Characters in input string include: A−Z, a−z, space

**Output Format:**
- Output is a decimal number rounded off to the nearest hundredth. (Write to STDOUT)

**Sample Input 0:**
```
Vivienne dined àt noon
```

**Sample Output 0:**
```
1.37
```

**Explanation 0:**
```
round(((2*8) + 0 + (1*2) + (2*4)) / 19, 2) = round(26 / 19, 2) = round(1.368421…, 2) = 1.37
```