comefrom: <gouthampradhan>string_FindTheClosestPalindrome_2.java
code: private String getHigh(String s) {
      int n = s.length() - 1;
      StringBuilder sb = new StringBuilder();
      sb.append("1");
      for (int i = 0; i < n; i++) {
        sb.append("0");
      }
      sb.append("1");
      return sb.toString();
    }
masked: private String var_0 ( String var_2 ) {
    int var_5 = var_2 . length ( ) - 1 ;
    StringBuilder var_7 = new StringBuilder ( ) ;
    var_7 . append ( "1" ) ;
    for ( int var_11 = 0 ;
    var_11 < var_5 ;
    var_11 ++ ) {
      var_7 . append ( "0" ) ;
    }
    var_7 . append ( "1" ) ;
    return var_7 . toString ( ) ;
  }
  