Introduction
------------

Dice 10,000 is a dice game which can be played with 6 dice and something to write. Players roll the dice multiple times a turn and gain a score at the end of it. The player who reaches 10,000 point first wins the game. Calculating the score of one roll is your job in this challenge.  

[Look here](https://en.wikipedia.org/wiki/Dice_10000) for the full rules.  

*Please note that the rules (especically the scoring) change from region to region since the game is widely known. We use the rules descibed below.*

The Challenge
-------------

Given a list of six numbers from one to six representing a dice roll, output their score. The score is calculated in the follwing way:

* Ones counts **100** points
* Fives counts **50** points
* Triplets count their number **times 100** points. Three twos for example give 200 points. An exception are three ones which count **1000** points.
* Six of the same number count like two triplets as described above. So six threes give 600 points. The same goes for the edge case with the ones: Six ones are 2,000 points.
* One die can't be used more than once. If a die is part of a triplet, it does not count for other scorings. The fives in a triplet do **not** count 50 points in addition to the 500 points they give.
* Triples are always counted first to maximize the score. So three fives are never counted as 150 points. Four fives are counted as one triplet and one ordinary five which then gives 550 points.

### Notes

* The input will always contain six numbers from one to six. You will not recieve invalid input.
* The numbers can be in any order. You may not assume any specific ordering.

Rules
=====

* Input format is up to you as long as it's not preprocessed.
* Function or full program allowed.
* [Default rules](http://meta.codegolf.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods) for input/output.
* [Standard loopholes](http://meta.codegolf.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default) apply.
* This is [code-golf](/questions/tagged/code-golf "show questions tagged 'code-golf'"), so lowest byte-count wins. Tiebreaker is earlier submission.

Test cases
==========

```

[1, 2, 3, 4, 5, 6] -> 150
[1, 1, 1, 2, 3, 5] -> 1050
[1, 1, 1, 1, 1, 1] -> 2000
[2, 2, 2, 2, 2, 2] -> 400
[6, 6, 1, 5, 5, 6] -> 800
[2, 3, 4, 6, 2, 4] -> 0
[1, 5, 1, 5, 1, 5] -> 1500
[5, 5, 5, 5, 2, 3] -> 550
[1, 1, 1, 1, 1, 5] -> 1250
[3, 3, 4, 4, 3, 4] -> 700

```