ia7ck

#include<iostream>
#include<vector>

using namespace std;
#define int long long
#define repeat(i,n) for(int i=0;i<(n);i++)

struct Median{
  int K, k, md;
  vector<int> prv, nxt;

ia7ck

class SegmentTree
  def initialize(n)
    @root, @nil=0, 0
    @sz=2**(Math.log(n)/Math.log(2)).ceil
    @seg=Array.new(2*@sz-1){@nil}
  end

  attr_accessor :seg

  def max(a, b, i=@root, l=0, r=@sz)

ia7ck

class BinaryIndexedTree
  def initialize
    @N=200_001
    @bit=Array.new(@N){0}
  end
  
  def add(k, x)
    while k<=@N
      @bit[k]+=x
      k+=(k&-k)

ia7ck

n=gets.to_i
@g=Array.new(n){[]}
(n-1).times do |i|
  b=gets.to_i
  @g[b-1]<< i+1
end

def rec i
  if @g[i].size()==0
    1

ia7ck

#include<iostream>
#include<vector>
#include<queue>
 
using namespace std;
#define int long long
 
struct Edge{
 
   int to, c;

ia7ck

#include<iostream>
#include<vector>
#include<algorithm>
 
using namespace std;
#define int long long
 
struct Edge{
 
   int a, b, c;

ia7ck

#include<iostream>
#include<vector>
#include<queue>
 
using namespace std;
typedef pair<int, int> pii;
vector<int> g[2*100000];
 
int main(){
 

ia7ck

#include<iostream>
#include<vector>

using namespace std;

int mySum(int m){

    return (m)*(m+1)/2;
}

ia7ck

#include<iostream>
#include<vector>
#include<stdio.h>
#define rep(i, n) for(int i=0; i<(n); i++)
#define pb push_back
 
using namespace std;
 
int main(){
 

ia7ck

#include<iostream>
 
using namespace std;
#define int long long
int R, B, x, y;
 
int cal(int k){
 
    int r=(R-k), b=(B-k);
    if(r<0||b<0) return -1;