#!/bin/bash
yum -y install httpd
systemctl enable httpd
systemctl start httpd
hostname > /var/www/html/index.html

fsfsdfsdfdsfsdf

{
    "bindAddress": "",
    "bindPort": 2001,
    "publicAddress": "",
    "publicPort": 2001,
    "a2s": {
        "address": "0.0.0.0",
        "port": 17777
    },
    "rcon": {
        "address": "0.0.0.0",
        "port": 19999,
        "password": "fobarma1234!",
        "permission": "admin",
        "blacklist": [],
        "whitelist": []
    },
    "game": {
        "name": "[NA1] FOB Arma | Arland Game Master | fobarma.com",
        "password": "",
        "passwordAdmin": "fobarma1234!",
        "admins": [
            "76561198054239558",
            "76561198097176793",
            "76561198968225358",
            "76561199833357392",
            "76561198073098171"
        ],
        "scenarioId": "{2BBBE828037C6F4B}Missions/22_GM_Arland.conf",
        "maxPlayers": 128,
        "visible": true,
        "crossPlatform": true,
        "gameProperties": {
            "serverMaxViewDistance": 2500,
            "serverMinGrassDistance": 150,
            "networkViewDistance": 1500,
            "disableThirdPerson": true,
            "fastValidation": true,
            "battlEye": true,
            "VONDisableUI": false,
            "VONDisableDirectSpeechUI": false,
            "VONCanTransmitCrossFaction": false
        },
"mods": [
                {
                "modId": "595F2BF2F44836FB",
                "name": "RHS - Status Quo"
            }
]
},
    "operating": {
        "lobbyPlayerSynchronise": true,
        "joinQueue": {
            "maxSize": 50
        }
    }
}

alert('123');

var obj = {
    prop: 1,
    getProp: function(){
         return function() { console.log(this.prop) };
    },
};

obj.getProp()();

class Solution {
public:
    bool isGoodLength(int len, string& s) {
        
    }

    string longestPalindrome(string s) {
        int l = 1; // a string of length 1 can always be a pallindrome
        int r = s.length() + 1; // it is impossible to find a string of length s.length() + 1, leave alone pallindromic

        while(r > l + 1) {
            int mid = l + (r - l) / 2;

            if(isGoodLength(mid, s)) {
                l = mid;
            } else {
                r = mid;
            }
        }
    }
};