#include <stdio.h>

int main(int argc, char** argv){
    printf("Hello world");
    return 0;

#include
using namespace std;

int main()
(

function NPC_QUEST_1998(cnum,reqNumber) -- Âí³ÇGMͼ´«ËÍÓÃ

  local resultmsg, req, name, type = nil
  req = reqNumber
  name = GetHeroName(cnum)

function NPC_QUEST_1998(cnum,reqNumber) -- Âí³ÇGMͼ´«ËÍÓÃ

  local resultmsg, req, name, type = nil
  req = reqNumber
  name = GetHeroName(cnum)

function NPC_QUEST_1998(cnum,reqNumber) -- Âí³ÇGMͼ´«ËÍÓÃ

  local resultmsg, req, name, type = nil
  req = reqNumber
  name = GetHeroName(cnum)

#include<isotream>
using namespace std;

int main()
(

//bai 53 khai niem va cach su dung ham
	/*ham la mot khoi lenh thuc hien mot cong viec hoan chinh (module), dc dat ten va dc goi thuc thi nh lan tai nh vi tri trong chuong trinh
	ham dc goi la chuong trinh con (subroutine)
	ham co the dc goi tu chuong trinh chinh (ham main) hoac tu mot ham khac
	ham co gia tri tra ve hoac ko. neu ham ko co gia tri tra ve goi la thu tuc (procedure)

#include<isotream>
using namespace std;

int main()
(

   void main(){                /*Line 1 */
    int I, N;               /*Line 2 */
    fro(I=0, I<N, I++);	/*Line 3 */
}

   void main(){                /*Line 1 */
    int I, N;               /*Line 2 */
    fro(I=0, I<N, I++);	/*Line 3 */
}

   void main(){                /*Line 1 */
    int I, N;               /*Line 2 */
    fro (I=0, I<N, I++);	/*Line 3 */
}

   void main() {                /*Line 1 */
    int I, N;               /*Line 2 */
    fro (I=0, I<N, I++);	/*Line 3 */
}

void main() {                /*Line 1 */
    int I, N;               /*Line 2 */
    fro (I=0, I<N, I++);	/*Line 3 */
}

void main() {                /*Line 1 */
    int I, N;               /*Line 2 */
    fro (I=0, I<N, I++);	/*Line 3 */
}

void main() {                /*Line 1 */
    int I, N;               /*Line 2 */
    fro (I=0, I<N, I++);	/*Line 3 */
}

int main() {                /*Line 1 */
    int I, N;               /*Line 2 */
    fro (I=0, I<N, I++);	/*Line 3 */
}

def tong(h):
    tong = 0
    while ( h > 0):
        tong += h % 10
        h  = h // 10

010010111010101110101110100111010100101110101010100010111101010111111010101011001110100001010101
110101010010110
010101
101010101010101010101
010

# You will be given an array of numbers. You have to sort the odd numbers 
# in ascending order while leaving the even numbers at their original positions.
# 
# Examples
# [7, 1]  =>  [1, 7]

#include <iostream>
#include <iomanip.h>
using namespace std;

void MENU(){