user: 请从给定的汇编指令推导出C源代码：

```asm
<main>:
  endbr64
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x18,%rsp
  mov    %fs:0x28,%rax
  mov    %rax,0x8(%rsp)
  xor    %eax,%eax
  lea    D74(%rip),%r13
  lea    D132(%rip),%rbx
  lea    D58(%rip),%r12
  lea    D106(%rip),%rbp
L61:
  mov    %r13,%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  mov    %rbx,%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  mov    %r12,%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  mov    %rbp,%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  lea    D46(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  lea    D41(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  lea    D129(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  mov    %rbx,%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  lea    D121(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  mov    %rsp,%rsi
  lea    D97(%rip),%rdi
  call   <scanf@plt>
  cmpl   $0x5,(%rsp)
  ja     L35
  mov    (%rsp),%eax
  lea    D143(%rip),%rdx
  movslq (%rdx,%rax,4),%rax
  add    %rdx,%rax
  notrack jmp *%rax
  lea    D36(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  lea    0x4(%rsp),%rsi
  lea    D97(%rip),%rdi
  call   <scanf@plt>
  mov    0x4(%rsp),%edi
  call   <Enqueue@plt>
  mov    0x4(%rsp),%esi
  lea    D62(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  jmp    L61
  mov    $0x0,%eax
  call   <is_empty@plt>
  test   %eax,%eax
  jne    L40
  call   <Dequeue@plt>
  mov    %eax,%esi
  lea    D142(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  jmp    L61
L40:
  lea    D39(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  jmp    L61
  mov    $0x0,%eax
  call   <is_empty@plt>
  test   %eax,%eax
  jne    L61
  call   <Front@plt>
  mov    %eax,%esi
  lea    D1(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  jmp    L61
  mov    $0x0,%eax
  call   <Display@plt>
  jmp    L61
L35:
  lea    D51(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  jmp    L61
  mov    0x8(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L10
  add    $0x18,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  ret
L10:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: disassemble_data
arguments: data_label: D74
type: string
name: disassemble_data
arguments: data_label: D132
type: string
name: disassemble_data
arguments: data_label: D58
type: string
name: disassemble_data
arguments: data_label: D106
type: string
name: disassemble_data
arguments: data_label: D46
type: string
name: disassemble_data
arguments: data_label: D41
type: string
name: disassemble_data
arguments: data_label: D129
type: string
name: disassemble_data
arguments: data_label: D121
type: string
name: disassemble_data
arguments: data_label: D97
type: string
name: disassemble_data
arguments: data_label: D36
type: string
name: disassemble_data
arguments: data_label: D62
type: string
name: disassemble_data
arguments: data_label: D142
type: string
name: disassemble_data
arguments: data_label: D39
type: string
name: disassemble_data
arguments: data_label: D1
type: string
name: disassemble_data
arguments: data_label: D51
type: string

tool: D74: 

Queue Operations

tool: D132: 
----------------

tool: D58: 
1. Enqueue

tool: D106: 
2. Dequeue

tool: D46: 
3. Front

tool: D41: 
4. Display

tool: D129: 
5. Exit

tool: D121: 
Enter your choice: 

tool: D97: %d

tool: D36: 
Enter the element to be enqueued: 

tool: D62: 
Enqueued element: %d

tool: D142: 
Dequeued element: %d

tool: D39: 
Error: Queue is empty

tool: D1: 
Front element: %d

tool: D51: 
Invalid Choice

assistant: ```c
void main() {
  int choice, element, flag = 1, temp;
  while (flag) {
    printf("\n\nQueue Operations");
    printf("\n----------------");
    printf("\n1. Enqueue");
    printf("\n2. Dequeue");
    printf("\n3. Front");
    printf("\n4. Display");
    printf("\n5. Exit");
    printf("\n----------------");
    printf("\nEnter your choice: ");
    scanf("%d", &choice);
    switch (choice) {
    case 1:
      printf("\nEnter the element to be enqueued: ");
      scanf("%d", &element);
      Enqueue(element);
      printf("\nEnqueued element: %d", element);
      break;
    case 2:
      if (!is_empty()) {
        temp = Dequeue();
        printf("\nDequeued element: %d", temp);
      } else {
        printf("\nError: Queue is empty");
      }
      break;
    case 3:
      if (!is_empty()) {
        temp = Front();
        printf("\nFront element: %d", temp);
      }
      break;
    case 4:
      Display();
      break;
    case 5:
      flag = 0;
      break;
    default:
      printf("\nInvalid Choice");
    }
  }
}
```