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

```asm
<main>:
  endbr64
  push   %r15
  lea    D89(%rip),%r15
  push   %r14
  lea    D76(%rip),%r14
  push   %r13
  lea    D53(%rip),%r13
  push   %r12
  lea    D85(%rip),%r12
  push   %rbp
  lea    D23(%rip),%rbp
  push   %rbx
  lea    D102(%rip),%rbx
  sub    $0x28,%rsp
  mov    %fs:0x28,%rax
  mov    %rax,0x18(%rsp)
  xor    %eax,%eax
  lea    0x10(%rsp),%rax
  mov    %rax,0x8(%rsp)
  cs nopw 0x0(%rax,%rax,1)
L21:
  mov    %r15,%rdi
  xor    %eax,%eax
  call   <printf@plt>
  mov    %rbp,%rdi
  xor    %eax,%eax
  call   <printf@plt>
  mov    %r14,%rdi
  xor    %eax,%eax
  call   <printf@plt>
  mov    %r13,%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    D75(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    D147(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    D105(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  mov    %rbp,%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    D11(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  mov    0x8(%rsp),%rsi
  mov    %r12,%rdi
  call   <scanf@plt>
  cmpl   $0x5,0x10(%rsp)
  ja     L12
  mov    0x10(%rsp),%eax
  movslq (%rbx,%rax,4),%rax
  add    %rbx,%rax
  notrack jmp *%rax
  mov    0x18(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L30
  add    $0x28,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
  nopl   0x0(%rax,%rax,1)
  xor    %eax,%eax
  call   <Display@plt>
  jmp    L21
  nopl   0x0(%rax)
  xor    %eax,%eax
  call   <is_empty@plt>
  test   %eax,%eax
  jne    L21
  call   <Front@plt>
  lea    D84(%rip),%rdi
  mov    %eax,%esi
  xor    %eax,%eax
  call   <printf@plt>
  jmp    L21
  nopl   0x0(%rax)
  xor    %eax,%eax
  call   <is_empty@plt>
  test   %eax,%eax
  jne    L92
  call   <Dequeue@plt>
  lea    D91(%rip),%rdi
  mov    %eax,%esi
  xor    %eax,%eax
  call   <printf@plt>
  jmp    L21
  nopl   (%rax)
  lea    D156(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    0x14(%rsp),%rsi
  mov    %r12,%rdi
  call   <scanf@plt>
  mov    0x14(%rsp),%edi
  call   <Enqueue@plt>
  mov    0x14(%rsp),%esi
  lea    D111(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  jmp    L21
L12:
  lea    D141(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  jmp    L21
L92:
  lea    D26(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  jmp    L21
L30:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: read_data
arguments: data_tag: D89
type: string
name: read_data
arguments: data_tag: D76
type: string
name: read_data
arguments: data_tag: D53
type: string
name: read_data
arguments: data_tag: D85
type: string
name: read_data
arguments: data_tag: D23
type: string
name: read_data
arguments: data_tag: D75
type: string
name: read_data
arguments: data_tag: D147
type: string
name: read_data
arguments: data_tag: D105
type: string
name: read_data
arguments: data_tag: D11
type: string
name: read_data
arguments: data_tag: D84
type: string
name: read_data
arguments: data_tag: D91
type: string
name: read_data
arguments: data_tag: D156
type: string
name: read_data
arguments: data_tag: D111
type: string
name: read_data
arguments: data_tag: D141
type: string
name: read_data
arguments: data_tag: D26
type: string

tool: D89: 

Queue Operations

tool: D76: 
1. Enqueue

tool: D53: 
2. Dequeue

tool: D85: %d

tool: D23: 
----------------

tool: D75: 
3. Front

tool: D147: 
4. Display

tool: D105: 
5. Exit

tool: D11: 
Enter your choice: 

tool: D84: 
Front element: %d

tool: D91: 
Dequeued element: %d

tool: D156: 
Enter the element to be enqueued: 

tool: D111: 
Enqueued element: %d

tool: D141: 
Invalid Choice

tool: D26: 
Error: Queue is empty

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");
    }
  }
}
```