#include <stdio.h>
#include <stdlib.h>

#define SIZE 7

void swap(int shift, int *arr, int size);
void sort(int *arr, int size);
int max(int a, int b, int c);
int min(int a, int b, int c);
int isIncKadomatsu(int a, int b, int c);

int main(void)
{
    char *str;
    int *d, idx, cnt = 0;
    
    str = (char*)calloc(sizeof(char), 4);
    d = (int*)calloc(sizeof(int), SIZE);
    for(idx = 0; idx < SIZE; idx++) {
        scanf("%d", &d[idx]);
    }
    
    sort(d, SIZE);
    swap(0, d, SIZE);
    /*
    for(idx = 0; idx < SIZE; idx++) {
        printf("%d ", d[idx]);
    }
    printf("\n");
    */
    for(idx = 0; idx < (SIZE-2); idx++) {
        if( isIncKadomatsu(d[idx], d[(idx+1)], d[(idx+2)]) ) {
            cnt++;
        }
    }
    if(cnt == (SIZE-2)) {
        printf("YES\n");
        return 0;
    }
    
    cnt = 0;
    sort(d, SIZE);
    swap(1, d, SIZE);
    /*
    for(idx = 0; idx < SIZE; idx++) {
        printf("%d ", d[idx]);
    }
    printf("\n");
    */
    for(idx = 0; idx < (SIZE-2); idx++) {
        if( isIncKadomatsu(d[idx], d[(idx+1)], d[(idx+2)]) ) {
            cnt++;
        }
    }
    if(cnt == (SIZE-2)) {
        printf("YES\n");
        return 0;
    }
    
    printf("NO\n");
    
    free(str);
    free(d);
    return 0;
}

void swap(int shift, int *arr, int size) {
    int idx, tmp;
    
    for(idx = shift; idx <= (size-3+shift); idx += 2) {
        tmp = arr[idx];
        arr[idx] = arr[(idx+1)];
        arr[(idx+1)] = tmp;
    }
}

void sort(int *arr, int size)
{
    int i, j, tmp;
    
    for(i = 0; i < size; i++) {
        for(j = i+1; j < size; j++) {
            if(arr[i] > arr[j]) {
                tmp = arr[j];
                arr[j] = arr[i];
                arr[i] = tmp;
            }
        }
    }
}

int max(int a, int b, int c)
{
    if(a > b) {
        if(a > c) {
            return a;
        }
        else {
            return c;
        }
    }
    else {
        if(b > c) {
            return b;
        }
        else {
            return c;
        }
    }
}

int min(int a, int b, int c)
{
    if(a > b) {
        if(b > c) {
            return c;
        }
        else {
            return b;
        }
    }
    else {
        if(a > c) {
            return c;
        }
        else {
            return a;
        }
    }
}

int isIncKadomatsu(int a, int b, int c)
{
    if (a == b || b == c || c == a) {
        return 0;
    }
    
    if (max(a, b, c) == b || min(a, b, c) == b) {
        if (a < c) {
            return 1;
        }
    }
    
    return 0;
}