Give you a statement and table with its title in Markdown format, please determine whether the statement is supported or refuted by, or is unrelated to the table. It'a binary classification problem, you should choose the answer between supported and refuted. Table cells in one row are seperated by '|', and different rows are seperated by '
'.

Table:
| dsl type | provider | resale | down (up to kbit / s) | up (up to kbit / s) |
| adsl2 + | deutsche telekom ag | no | 16000 | 1180 |
| adsl2 + | alice dsl / hansenet | some | 16000 | 1024 |
| adsl2 + | vodafone ag / arcor ag | yes | 16000 | 1024 |
| adsl2 + | 1&1 | yes | 16000 | 1180 |
| adsl2 + | qsc / telefã cubicnica | some | 16000 | 1024 |
| adsl2 + | versatel | yes | 16000 | 800 |
| adsl2 + | congstar | yes | 16000 | 1180 |
| adsl2 + | netcologne | no | 18000 | 1024 |
| adsl2 + | m - net | no | 18000 | 1024 |
| adsl2 + | willytel | no | 24000 | 1984 |
| adsl2 + | t - m - netde | no | 22000 | 1420 |
Title:
none
Statement:
16000 is the highest down (up to kbits / s) when resale is yes , up (up to kbit / s) is 1180 and provider is 1&1
Answer:
supported