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

int main() {
    int n, target;
    int lockers[10000];
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        int smaller, larger;
        scanf("%d %d %d", &lockers[i], &smaller, &larger);
    }
    scanf("%d", &target);
    int closest = lockers[0];
    int min_diff = abs(lockers[0] - target);
    
    for (int i = 0; i < n; i++) {
        int diff = abs(lockers[i] - target);
        
        // If closer, 
        if (diff < min_diff || (diff == min_diff && lockers[i] < closest)) {
            closest = lockers[i];
            min_diff = diff;
        }
    }
    
    printf("%d\n", closest);
    
    return 0;
}#include <stdio.h>
#include <stdlib.h>

int main() {
    int n, target;
    int lockers[10000];
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        int smaller, larger;
        scanf("%d %d %d", &lockers[i], &smaller, &larger);
    }
    scanf("%d", &target);
    int closest = lockers[0];
    int min_diff = abs(lockers[0] - target);
    
    for (int i = 0; i < n; i++) {
        int diff = abs(lockers[i] - target);
        
        // If closer, 
        if (diff < min_diff || (diff == min_diff && lockers[i] < closest)) {
            closest = lockers[i];
            min_diff = diff;
        }
    }
    
    printf("%d\n", closest);
    
    return 0;
}