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:
| platform | frequency (per hour) | destination | service pattern | operator | line |
| 1 | 4 | highbury & islington | all stations via shoreditch high street | london overground | east london |
| 1 | 4 | dalston junction | all stations via shoreditch high street | london overground | east london |
| 1 | 4 | london bridge | all stations | southern | metro |
| 2 | 4 | crystal palace | all stations | london overground | east london |
| 2 | 4 | west croydon | all stations | london overground | east london |
| 2 | 2 | london victoria (mon - sat) | all stations via clapham junction | southern | metro |
| 2 | 2 | caterham (mon - sat) | all stations via east croydon | southern | metro |
| 2 | 2 | west croydon (peaks & sun only) | sydenham then fast to norwood junction | southern | metro |
| 2 | 2 | tattenham corner (sun only) | all stations via east croydon | southern | metro |
Title:
forest hill railway station
Statement:
there are two platforms only and they are 1 and 2 and there are two frequencies (per hour) only , 2 and 4
Answer:
supported