Go: package main

import (
    "bufio"
    "os"
    "fmt"
)

var sc = bufio.NewScanner(os.Stdin)

/**************  Cell  *****************/
type Cell struct {
    item interface{}
    next *Cell
    prev *Cell
}

func NewCell(x interface{}, ne *Cell, pr *Cell) *Cell {
    newCp := new(Cell)
    newCp.item = x
    newCp.next = ne
    newCp.prev = pr
    return newCp
}
/************  End Cell  ***************/

/**************  Queue  ****************/
type Queue struct {
    size int
    front *Cell
    rear *Cell
}

func NewQueue() *Queue {
    return new(Queue)
}

func (q *Queue) Push(x interface{}) {
    newNode := NewCell(x, nil, nil)
    if q.size == 0 {
        q.front = newNode
        q.rear = newNode
    } else {
        newNode.prev = q.rear
        q.rear.next = newNode
        q.rear = newNode
    }
    q.size++
}

func (q *Queue) PopLeft() interface{} {
    if q.size == 0 {
        return nil
    } else {
        x := q.front.item
        if q.size == 1 {
            q.front = nil
            q.rear = nil
        } else {
            q.front = q.front.next
            q.front.prev = nil
        }
        q.size--
        return x
    }
}

func (q *Queue) IsEmpty() bool {
    return q.size == 0
}

func (q *Queue) Length() int {
    return q.size
}

type State struct {
    color string
    cnt int
}

func main() {
    for {
        sc.Scan()
        init := sc.Text()
        if init == "0" {
            break
        }
        bfs(init)
    }
}

func bfs(init string) {
    dic := make(map[string]int)
    que := NewQueue()
    que.Push(State{init, 0})
    length := len(init)
    isSolved := false
    for !que.IsEmpty() {
        state := que.PopLeft().(State)
        _, ok := dic[state.color]
        if ok {
            continue
        } else {
            dic[state.color] = state.cnt
        }

        if isSingleColor(state.color) {
            fmt.Println(state.cnt)
            isSolved = true
            break
        }

        for i := 0;i < length - 1; i++ {
            color1, color2 := string(state.color[i]), string(state.color[i + 1])
            if color1 != color2 {
                color3 := other(color1, color2)
                if i <= length - 2 {
                    que.Push(State{state.color[:i] + color3 + state.color[i + 2:], state.cnt + 1})
                } else {
                    que.Push(State{state.color[:i] + color3, state.cnt + 1})
                }
            }
        }
    }
    if !isSolved {
        fmt.Println("NA")
    }
}

func other(color1, color2 string) string {
    if color1 == "r" {
        if color2 == "g" {
            return "bb"
        } else if color2 == "b" {
            return "gg"
        }
    } else if color1 == "g" {
        if color2 == "r" {
            return "bb"
        } else if color2 == "b" {
            return "rr"
        }
    } else if color1 == "b" {
        if color2 == "r" {
            return "gg"
        } else if color2 == "g" {
            return "rr"
        }
    }
    return ""
}

func isSingleColor(color string) bool {
    for _, c := range color {
        if string(c) != string(color[0]) {
            return false
        }
    }
    return true
}

C++: #include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <set>
#include <climits>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second

static const double PI=6*asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int,int> P;
static const int INF=1<<24;

string s;
int qf;

int foo1(int D[]){
	int res=0;
	for(int i=0;i<s.size();i++){
		res*=10;
		res+=D[i];
	}
	return res;
}
void foo2(int D[],int m){
	rep(j,s.size()){
		D[j]=0;
	}
	for(int i=s.size()-1;i>=0;--i){
		D[i]=m%10;
		m/=10;
		rep(j,s.size()){
		}
	}
}


int a[30];
int tmp[30];
set<unsigned int> vis;

bool check(){
	int t=a[0];
	rep(i,s.size()){
		if(t!=a[i]) return false;
	}
	return true;
}

int main(){
	
	while(cin>>s,s[0]!='0'){
		vis.clear();
		int ans=0;
		queue<int> qu;
		rep(i,s.size()){
			if(s[i]=='r') a[i]=0;
			else if(s[i]=='g') a[i]=1;
			else if(s[i]=='b') a[i]=2;
		}
		if(check()){
			cout<<"0"<<endl;
			continue;
		}
		
		qu.push(foo1(a));
		vis.insert(foo1(a));
		bool f=false;
		bool f1=false;
		int c=0;
		while(!qu.empty()&&!f1){
			c++;
			if(c>50) break;
			f=false;
			ans++;
			int qs=qu.size();
			rep(i,qs){
				qf=qu.front();
				qu.pop();
				foo2(a,qf);
				if(check()){
					cout<<ans-1<<endl;
					f1=true;
					break;
				}
				rep(j,s.size()-1){
					if(a[j]!=a[j+1]){
						rep(k,s.size()){
							tmp[k]=a[k];
						}
						if(a[j]*a[j+1]==2){
							tmp[j]=0;
							tmp[j+1]=0;
						}
						else if(a[j]==2||a[j+1]==2){
							tmp[j]=1;
							tmp[j+1]=1;
						}
						else{
							tmp[j]=2;
							tmp[j+1]=2;
						}
						if(vis.find(foo1(tmp))==vis.end()){
							qu.push(foo1(tmp));
							vis.insert(foo1(tmp));
							f=true;
						}
					}
				}
				if(!f) break;
			}
			if(f1) break;
		}
		if(f1) continue;
		if(!f&&!f1) cout<<"NA"<<endl;
		
	}
	
	return 0;
}

C++: #include <iostream>
#include <queue>
#include <map>
#include <algorithm>
using namespace std;
#define pp(a,b) push(make_pair(a,b))
typedef pair<string,int> NODE;
char color(char a, char b){
	if(a>b)swap(a,b);
	if(a==b)return a;
	if(a=='b' && b=='r')return 'g';
	if(a=='b' && b=='g')return 'r';
	if(a=='g' && b=='r')return 'b';
	cout << "unko" << endl;
}
int main(){
	string n;
	char p1,p2;
	map<string,bool> done;
	while(cin >> n && n != "0"){
		bool f = false;
		queue<NODE> Q;
		done.clear();
		Q.pp(n,0);
		while(Q.size()){
			NODE q = Q.front();
			Q.pop();
			if( count(q.first.begin(),q.first.end(),'r') == q.first.size() || 
			    count(q.first.begin(),q.first.end(),'g') == q.first.size() ||
			    count(q.first.begin(),q.first.end(),'b') == q.first.size()
			){
				cout << q.second << endl;
				f = true;
				break;
			} 
			for(int i=0;i+1<q.first.size();i++){
				p1 = q.first[i];p2 = q.first[i+1];
				q.first[i] = q.first[i+1] = color(p1,p2);
				if(!done[q.first]){
					Q.pp(q.first,q.second+1);
					done[q.first] = true;
				}
				q.first[i] = p1;
				q.first[i+1] = p2;
			}
		}
		if(!f)cout << "NA" << endl;
	}
}

C++: #include<iostream>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
map<string, int> cache;
bool same(string seq){
  for(int i = 0; seq[i+1] != '\0'; ++i){
    if(seq[i] != seq[i+1]){
      return false;
    }
  }
  return true;
}
int dls(string seq, int depth){
  if(depth<0){
    return false;
  }
  if(same(seq)){
    return true;
  }
  if(cache.find(seq) != cache.end() && cache[seq] >= depth){
    return false;
  }
  else{
    cache[seq] = depth;
  }
  for(int i = 0; seq[i+1] != '\0'; ++i){
    char t = seq[i];
    char n = seq[i+1];
    if(t != n){
      if((t + n) == ('r' + 'b')){
        seq[i] = seq[i+1] = 'g';
      }
      else if((t + n) == ('r' + 'g')){
        seq[i] = seq[i+1] = 'b';
      }
      else{
        seq[i] = seq[i+1] = 'r';
      }
      if(dls(seq, depth-1)){
        return true;
      }
      seq[i] = t;
      seq[i+1] = n;
    }
  }
  return false;
}
void iddfs(string seq){
  cache = map<string, int>();
  for(int depth = 0;depth <= 20; ++depth){
    if(dls(seq, depth)){
      cout << depth << endl;
      return;
    }
  }
  cout << "NA" << endl;
}
int main(){
  char seq[11];
  while(true){
    cin >> seq;
    if(seq[0] == '0'){
      break;
    }
    iddfs(seq);
  }
  return 0;
}