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

#define MAX_N 10000

typedef struct {
    int data[MAX_N];
    int front, rear;
} Queue;

void initQueue(Queue* q) {
    q->front = q->rear = 0;
}

void enqueue(Queue* q, int val) {
    q->data[q->rear++] = val;
}

int dequeue(Queue* q) {
    return q->data[q->front++];
}

int isEmpty(Queue* q) {
    return q->front == q->rear;
}

char* predictPartyVictory(char* senate) {
    Queue radiant, dire;
    initQueue(&radiant);
    initQueue(&dire);
    
    int n = strlen(senate);
    
    // Initialize queues with senator positions
    for (int i = 0; i < n; i++) {
        if (senate[i] == 'R') {
            enqueue(&radiant, i);
        } else {
            enqueue(&dire, i);
        }
    }
    
    // Process until one queue is empty
    while (!isEmpty(&radiant) && !isEmpty(&dire)) {
        int rIndex = dequeue(&radiant);
        int dIndex = dequeue(&dire);
        
        // Earlier senator wins and gets back in line
        if (rIndex < dIndex) {
            enqueue(&radiant, rIndex + n);
        } else {
            enqueue(&dire, dIndex + n);
        }
    }
    
    return !isEmpty(&radiant) ? "Radiant" : "Dire";
}

int main() {
    char senate[MAX_N];
    scanf("%s", senate);
    
    // Remove quotes if present
    int len = strlen(senate);
    if (senate[0] == '"') {
        for (int i = 1; i < len-1; i++) {
            senate[i-1] = senate[i];
        }
        senate[len-2] = '\0';
    }
    
    printf("%s\n", predictPartyVictory(senate));
    return 0;
}